Question: 2017 Winter Midterm - 2
Let $b \geq 1$ and $g \geq 1$ be integers. Consider $b$ boys and $g$ girls. How many ways are there
to arrange these kids on a line such that the leftmost kid is a girl?
(a)
$(b + g)! / b$
(b)
$(b + g)!$
(c)
$g \cdot (b + g - 1)!$
(d)
None of the above.