For each of the following recursive methods, identify the base case, the general case, and the constraints on the argument values, and explain what the method does.

a.

int power(int base, int exponent)

{

if (exponent ==0)

return 1;

else

return (base * power(base, exponent-1));

}

b.

int factorial (int n)

{

if (n > 0)

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

else

if (n==0)

return1;

}