$64$

$1$ point

In the following code that uses recursion to find the factorial of a number, what is the base case?

private static int factorial$($int $n)$

$\{$

if $)==(0$

return $1$ ;

else

return $n*$ factorial$($n$-1)$;

$\}$

else

return $n*$ factorial$(n-1)$;

Cannot tell from this code

if $)==(0$

return $1$;

factorial$($int $n)$

Clear my selection