Estimate the number of recursive calls that would be used by the code

to compute binomial(100, 50). Develop a better implementation that is based on dynamic programming.

public static double binomial(int n, int k) { } if ((n == 0) && (k == 0)) if ((n < 0) || (k < 0)) return (binomial(n-1, k) return 1.0; return 0.0; + binomial(n-1, k-1))/2.0;