If each activation record for $$recurrence$($stack frame for the function$)$ requires $128$ bytes of storage, and the maximum stack size possible on a machine is $2000$ bytes, identify all of the following recursive function calls that will not be able to execute on the machine. $[6]($L$6)$

int recurrence$($int n$)$

$\{$

if $(($n$==0))$

return$(1)$;

else

return$($recurrence$($n$-1)+$recurrence$($n$-2))$;

$\}$

A$.$ recurrence$(16)$

B$.$ recurrence$(20)$

C$.$ recurrence$(35)$

D$.$ recurrence$(100)$

E$.$ recurrence$(4)\_\_\_\_\_\_\_\_\_\_<-----$ Answer$($s$)$ go here