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 (n == 0)
return 1;
else
return n * factorial(n - 1);
}
A. if (n == 0)
return 1;
B. else
return n * factorial(n-1);
C. factorial(int n)
D. Cannot tell from this code