❓Use mathematical induction to show that when n ≥ 2 is an exact power of 2, the solution of the recurrence: is 💡