Suppose a 5 lb knapsack is to be filled with the items listed below. To maximize your benefit, how should the knapsack be filled? Solve the problem using dynamic programming.