Question 2: Recursive Combinations (3 points) Given a set of n items, we can choose k of them in n Ck ways. That is, if we have n-3 items (for instance, an apple, an orange, and a pear) and we want to select k-2 of them, there are 3C3 = 3 ways to do this (an apple and an orange, an orange and a pear, or an apple and a pear). We can compute nCk recursively: ifk=0, if n