Please help me determine setup equation.

Prove by induction on integers that recurrence T(2k) = 2 if k=1 T(2k) = 2T(2k-1) + 2k if k>1 has solution T(2k) = k2k = = For k=1, base case is true by definition Prove base cases for k=2. Report setup equation for method if S(n-1) then S(n). Report the inductive hypothesis. Report the application of the inductive hypothesis