The time and space efficiency for the Binomial(n,k) algorithm is ().Rewrite the Binomial(n,k) function with () space efficiency. See below for algorithm:

C(n, k) = C(n-1, k-1) + C(n-1, k) C(n,0) - C(n, n)-1 for n > k 0, Algorithm Binomial(n,k //Computes C(n, k) by the dynamic programming algorithm Input: A pair of nonnegative integers n2k 2 0 //Output: The value of C(n, k) for i-0 to n do for j 0 to min(2. k) do return C[n,k]