Question 5. In this question, we'll use the plug-and-chug method to solve the recurrence: ifn = 2k for k > 1 ifn=2') = 1 41V,a/e+ 2n (a) In class, we saw that for the Towers of Hanoi the minimum number of moves Tn satisfied the recurrence 2Tn-1 + 1, To O. From there, we discussed two different ways to show Tn T, = -2'1-1 for all n > 1. One way is to use the plug-and-chug method (plugging means applying the recursive equation, chugging means simplifying the resulting expression) Question 5. In this question, we'll use the plug-and-chug method to solve the recurrence: ifn = 2k for k > 1 ifn=2') = 1 41V,a/e+ 2n (a) In class, we saw that for the Towers of Hanoi the minimum number of moves Tn satisfied the recurrence 2Tn-1 + 1, To O. From there, we discussed two different ways to show Tn T, = -2'1-1 for all n > 1. One way is to use the plug-and-chug method (plugging means applying the recursive equation, chugging means simplifying the resulting expression)