1. Discuss a DP for the LBS problem (see Lec 9).

2. Discuss a DP the the alternative formulation of the Knapsack problem using the following function:
    B[j,v] = smallest weight possible with total value >= v using items {1 ... j}

3. JE Chapter-3 Exercise 5d.