$6.$ Consider the following code for computing binomial coefficients.

static int binomialCoeff$($int n$,$ int k$)$

$\{$

if $($k $>$ n$)$

return $0$;

if $($k $==0||$ k $==$ n$)$

return $1$;

return binomialCoeff$($n $-1,$ k $-1)$

$+$ binomialCoeff$($n $-1,$ k$)$;

$\}$

a$.$ What is$/$are the base case$($s$)$ for this algorithm? $(1$ mark$)$

b$.$ What is the recursive relation for this algorithm? $(1$ mark$)$

c$.$ Use dynamic programming approach to rewrite the above code using the memoization technique. $(3$ marks$)$