Recursion

Computing a positive integer power of a number is easily seen as a recursive process. Consider an : If n = 0, an is 1 (by definition) If n > 0, an is a * an1 Write Power.java which contains the main method that reads in integers base and exp using the Scanner class and calls an internal method power to compute baseexp recursively. The power method returns 1 if the exponent is 0, otherwise returns the power.