Data Structures, Algorithms, & Applications in C++
Chapter 19, Exercise 5

(a)

Equation 20.1 becomes f(n,y) = 0 for 0 <= y < wn, f(n,y) = pn for wn <= y < 2wn, and f(n,y) = 2pn for y >= 2wn.

Equation 20.2 becomes f(i,y) = f(i+1,y) for 0 <= y < wi, f(i,y) = max{f(i+1,y), f(i+1,y-wi) + pi} for wi <= y < 2wi, and f(i,y) = max{f(i+1,y), f(i+1,y-wi) + pi, f(i+1,y-2wi) + 2pi} for y >= 2wi.