For c++

How many possible bridge hands are there? This question is a specific case of the general question: how many combinations of X items can I make out of Y items? In the case of the bridge hand, X is 13 and Y is 52. The solution is given by the following formula: Combinations(Y, X) = Y if X = 1 1 if X = Y (Combinations(Y-1, X-1) + Combinations(Y-1, X)) if Y > X > 1 Write a recursive function that calculates the number of combinations of X items that can be made from Y items. Write a driver and answer the original questions. For this exercise you should use 7 for Y and 3 for X.