keyceebhe7629 keyceebhe7629 28-02-2024 Mathematics contestada Use mathematical induction to show that when n is an exact power of 2, the solution of the recurrence t(n) = 2 if n is divisible by 2; 2t(n/2) / n if n is divisible by 2ᵏ, for k > 1 is t(n) = n lg n?
