C++

5. Write a recursive version of that works by breaking n down into halves, squaring Power(x,n/2), and multiplying by x again if n was odd. For example: x*11 = x^5 * x^5 * x x^ 10 = x^5 * x^5