1. Exercise 4 (a) of Chapter 1 (Recursion). Once you come up with a candidate algorithm, write a recurrence that describes the number of moves it makes. That is a sufficient answer, you don't need to solve the recurrence. Exactly how many moves does your algorithm make when the number of disks n equals 4? (10 points)
2. Exercise 9 (a,b,c) of Chapter 1. (20 points)
3. Exercise 12 (b,c) of Chapter 1 (10 points). You don't have to solve 12 (a) but I encourage you to think about the claim we are being asked to prove there.

The homework is due in class on Thursday, January 24. Please pay attention to the policy on collaboration outlined in the syllabus.