Prove the identity $n r %$r k % = $n k %$n−k r−k % , whenever n, r, and k are nonnegative integers with r ≤ n and k ≤ r, a. using a combinatorial argument. b. using an argument based on the formula for the number of r-combinations of a set with n elements