Need solutions to the following practice problems: Let a and n be nonnegative integers. Consider the problem of calculating the nth power of a: a^n . Develop a transform-and-conquer algorithm for the calculation and describe the key idea behind your transformation. Determine and show the range for the number of multiplications performed overall. Test your algorithms in Java at: http://codingbat.com/prob/p158888 Your method should use the signature as follows (**very important: solution should be answered in this format**): public int powerN(int base, int n) { }