Recall that in the knapsack problem, we are given n items with positive integer weights w1, . . , wn and values v1, . . , vn, and a knapsack of size w; we want to pick a subset of items with maximum total value that fit the knapsack, i. e., their total weight is not larger than the size of the knapsack. in the class, we designed a dynamic programming algorithm for this problem with o(nw) runtime. our goal in this problem is to design a different dynamic programming solution. suppose you are told that t