Prove that the formula for the number of k-element subsets (or combinations) of an n-element set, given by C(n,k) = n! / (k! (n-k)!), satisfies the recurrence relation C(n, k) = C(n-1, k-1) + C(n-1, k) for all n >= 1 and 0