(a)
First arrange $m$ men in a row in $m!$ ways. Since, $n < m$ and no two women can sit together in any one of the $m!$ arrangement, there are $(m + 1)$ places in which $n$ women can be arranged in $\ ^{m + 1}P_{n}$ ways.
$\therefore$ The required number of arrangements of $m$ men and $n$ women $(n < m)$
$= {m!}^{m + 1}P_{n} = \frac{m!(m + 1)!}{(m - n + 1)!}$