c++

compute the exponent of a number.

Input: User inputs the base and exponent, named x and n.

Output: print out the value of xⁿ and how many multiplications which have been executed. How fast can you implement this job (in terms of smallest number of multiplications)?

Test your program on the following five inputs and print out the output for each input.

Input 1: 2 8

Input 2: 0.2 7

Input 3: 6.2 32

Input 4: 2 64

Input 5: 2 63