Solve the recurrence relation for computing the binomial coefficients (seen below).

a. Solve the recurrence relation for computing the binomial coefficients (seen below). C(n, kC(n -1,k 1 C(n 1,k for n > k>0, Algorithm Binomial (n, k) //Computes C(n, k) by the dynamic programming algorithm //Input: A pair of nonnegative integers n 2k2(0 //Output: The value of C(n, k) for 0 to n do for j 0 to min(i, k) do return Cn, k] Hint: Think about the "shape" of a table that records values for binomial coefficient, that has n+1 rows and k+1 columns. a. Solve the recurrence relation for computing the binomial coefficients (seen below). C(n, kC(n -1,k 1 C(n 1,k for n > k>0, Algorithm Binomial (n, k) //Computes C(n, k) by the dynamic programming algorithm //Input: A pair of nonnegative integers n 2k2(0 //Output: The value of C(n, k) for 0 to n do for j 0 to min(i, k) do return Cn, k] Hint: Think about the "shape" of a table that records values for binomial coefficient, that has n+1 rows and k+1 columns