This problem considers two ways to compute x^n for some n0.

(a) Write an iterative method power1 to compute x^n for n0.

(b) Write a recursive method power2 to compute x^n by using the following recursive formulation:

x^0 = 1

x^n = x * x^n-1 if n > 0

(c) Write an accompanying main method which invokes both power1 and power2 for increasing values of n up to n = 32