Write a proof by induction to show that power(x, n) correctly returns x^n. power(x, n): // Precondition: x > 1, int n >= 0. Assume no overflows. if n = then return 1 else s = power(x*x, n/2) return n%2==0 ? 5: s*x