This problem considers two ways to compute for some 0.

1. Write an iterative method power1 to compute for 0.

2. Write a recursive method power2 to compute by using the following recursive formulation:

   0 = 1

   =1>0

3. Write an accompanying main method which invokes both power1 and power2 for increasing values of n up to n = 16 (5 points).