May I have the steps to solve this problem, please? Thank you.

Explain what is wrong with the following proof. The answer should be in one sentence. False Statement. Let a be any positive number. Then, for all integers n 2 1, we have a"-1 = 1. Wrong Proof. By induction on n. For n = 1, we have a"-1 = a = 1, so the base case holds. Suppose that the theorem is true for n = 1, 2, ..., k. For n = k + 1, we have a(k+1)-1 = qk *-1 x qk-1 1 x1 = 1 ak-2 1 (3) which completes the inductive step