2. The binomial coefficient is the number of combinations/sets of picking k items form a bin containing n items. It is often written as:
=
a) What problems might arrive if we use the formula directly?
b) How might we write the binomial coefficient recursively?
(HINT: Split the sets into two groups as sets with a specific item and sets without the specific item.)
3. How can we write the dynamic programming algorithm for binomial coefficient?