The problem numbers refer to the textbook on Jeff Erickson's algorithms page. Unlike Homework 3, you will be expected to give a polynomial-time algorithm for each of these problems if that is possible.
  1. Exercise 11 (a) of Chapter 3 (Dynamic Programming). (10 points)
  2. Exercise 11 (c) of Chapter 3. (10 points)

The homework is due in class on Tuesday, February 26. Please pay attention to the policy on collaboration outlined in the syllabus.