Implement A Method That Returns The Value Of The Function Xn RECURSIVELY, Where X Is The Base And N Is The Exponent. The Way That We Will Compute This Value Is By Using The Concept Of Fast Exponentiation, Given By This Definition: Non-Recursive Implementations Will Not Receive

Implement a method that returns the value of the function xⁿRECURSIVELY, where x is the base and n is the exponent.

The way that we will compute this value is by using the concept of fast exponentiation, given by this definition:

Non-recursive implementations will not receive credit

You CANNOT use the pow(double a, double b) method from the Math class. Implementations that use this method will not receive credit

public class Q5 { /** * Returns the value of the function x^n RECURSIVELY using fast exponentiation, * where x is the base and n is the exponent. * * Non-recursive implementations will not receive credit * WARNING: You CANNOT use the pow(double a, double b) method from the Math class. * @param x - base * @param n - exponent * @return value of x^n */ public static double pow(double x, int n) { /*ADD YOUR CODE HERE*/ return 0.0; //Dummy Return }

}