In this assignment you will write a C program that uses recursion to print out all ????-element subsets of the ????-element set {1,2,3,…,????}, where both ???? and ???? are given on the command line.  Recall that the Binomial Coefficient ????(????,????) is defined to be the number of such subsets, and that these numbers can be computed recursively using Pascal’s identity.  For instance, if ???? = 4 and ???? = 2, one verifies ????(4,2) = 6, and that the 2-element subsets of {1,2,3,4} are: {1,2},{1,3},{1,4},{2,3},{2,4},{3,4}.  The core idea of our recursive solution is the same as in the proof (see notes from 6-25-19) of Pascal’s identity.

Details are in the CSE15pa1.pdf