1. Write each of the following recursive methods and for each one, write a main method to test it.

(i) public static int sumCubes(int n) Returns the sum of the sequence: 13 + 23 + 33+ . + n3 (ii) public static double betterPower(double x, int n) This is an improved version of the power method that takes advantage of the following properties: xn = xn/2 * xn/2 for even values of n xn = x * xn/2 * xn/2 for odd values of n

(iv) public static int GCD(int n, int m) Returns the Greatest Common Divisor (GCD) of two numbers n and m, define as follows:

if ,11 11 and 11 mod m = 0 GCD(n, m ) = if n