Computing Powers

Computing a positive integer power of a number is easily seen asa 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 integersbase and exp and calls method power tocompute base^exp. Fill in the code forpower to make it a recursive method to do the powercomputation. The comments provide guidance.

// ****************************************************************//   Power.java////   Reads in two integers and uses a recursive power method//   to compute the first raised to the second power.// ****************************************************************import cs1.Keyboard;public class Power{    public static void main(String[] args)    {        int base, exp;        int answer;        System.out.print("Welcome to the power program! ");        System.out.println("Please use integers only.");                //get base        System.out.print("Enter the base you would like raised to a power: ");        base = Keyboard.readInt();        //get exponent        System.out.print("Enter the power you would like it raised to: ");        exp = Keyboard.readInt();        answer = power(base,exp);        System.out.println(base + " raised to the " + exp + " is " + answer);    }    // -------------------------------------------------    //   Computes and returns base^exp    // -------------------------------------------------    public static int power(int base, int exp)    {        int pow;        //if the exponent is 0, set pow to 1            //otherwise set pow to base*base^(exp-1)        //return pow        }}