Question: 2017 Winter Midterm - 2

Author: Michiel Smid

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)

g \cdot (b + g - 1)!

(b)

None of the above.

(c)

(b + g)! / b

(d)

(b + g)!