(Compute greatest common divisor using recursion in java) The gcd(m, n) can also be defined recursively as follows:

If = % n is 0, gcd(m, n) is n.

Otherwise, gcd(m, n) is gcd(n, m % n).

Write a recursive method to find the GCD. Write a test program that prompts the user to enter two integers and displays their GCD.

(Sum series) Write a recursive method to compute the following series:

Write a java test program that displays = (I) for I = 1, 2 ......., 10.