What is the maximum depth of the stack for the following code in terms of number of stack frames $($one stack frame

per function call$)?$ Be sure to count the first call to main.

int main$)\{$

$f(12)$;

return $1$ ;

$\}$

int int $n$

if $(n0)$

return $0$ ;

else

return $f(n-1)+2**f(n-4)$;

$\}$