The phrase “n choose k” is used to refer to the number of ways in which we can choose k objects from a set of n objects, where n >= k >= 0. For example, 52 choose 13 would express the number of...

The phrase “n choose k” is used to refer to the number of ways in which we can choose k objects from a set of n objects, where n >= k >= 0. For example, 52 choose 13 would express the number of possible hands that could be dealt in the game of bridge. Write a program that takes the values of n and k as inputs and displays as output the value n choose k. Your program should define a recursive method, nChooseK(n, k), that calculates and returns the result. (Hint: We can partition the selections of k objects from n objects as the groups of k objects that come from n – 1 objects and the groups of k objects that include the nth object in addition to the groups of k – 1 objects chosen from among n – 1 objects.) If you test the program with n = 52 and k = 13, you should be prepared to wait quite a while for the solution!