Computing Powers

Computing a positive integer power of a number is easily seen as a recursive process. Consider aⁿ:

• If n = 0, aⁿ is 1 (by definition)
• If n > 0, aⁿ is a * a^n-1

File Power.java contains a main program that reads in integers base and exp and calls method power to compute base^exp. Fill in the code for power to make it a recursive method to do the power computation. The comments provide guidance.