The problems in this home work are from Lecture 5 of Jeff Erickson's notes. If a problem asks you to design an algorithm, you should aim to design an algorithm with polynomial running time whenever possible. Each of the five items below is worth 10 points.
  1. Exercise 5 (a) and 5 (b).
  2. Exercise 8 (a).
  3. Exercise 8 (c).
  4. Exercise 10 (a).
  5. Exercise 36.

The homework is due in class on Thursday, March 1.