The formula for computing the number of combinations that result from choosing r different items from a set of size n is C(n,r) = n!/[r!(n-r)!] where the factorial notation is defined as n!=n(n-1)(n-2)...2*1. Develop a recursive version of the combinations formula C(n,r) and write a recursive function that computes the value of the formula. Add the function as a subfunction of a driver function that tests it. The final product will consist of the project function, the printHeader function, an input function that will prompt the user for n and r and error check that r is less than or equal to n, your recursive combinations function, and an output function.

These 4 pictures in order show how the problem is supposed to be laid out.

PSC 321 Date Description you would put than here define includes cludosianoni lude onath Class Definitions class culation Integer par neter Any ot nit variables would be canaidernd terforary are ean be Hhen you Tun tion Prototype vold old netin tion ot the progr tunet on print meader c"Your tare". unctiun "Program. Descript in "Mrsc 121 "Date". input data and oatput into TTa ton object to hoid the ces binatiena arri Both variables ntr the for the inpi 1culate the Call uppropriate funetio Call the appropriate turetion to print the resulta by pass ng the