Does the recursive algorithm for raising x to the power n wok for negative values of n? Does it work for negative values of x? Indicate what happens if it is called for each of these cases, commenting it out as you go.

/** Recursive power method (in RecursiveMethods.java).

pre: n >= 0

@param x The number being raised to a power

@param n The exponent

@return x raised to the power n

*/

public static double power(double x, int n) {

if (n == 0)

return 1;

else

return x * power(x, n - 1);

}