Let n, r, k be integers with 0 ≤ k ≤ r ≤ n. Give a combinatorial proof that C(n, r)C(r, k) = C(n, k)C(n−k, r−k).

a) Use mathematical induction
b) Apply the binomial theorem
c) Count subsets in two ways
d) Evaluate the determinant of a matrix