Problem 3: Consider a Knapsack problem with unlimited units of the three items shown in Table 1. The weight capacity of the knapsack is 5. Using dynamic programming, determine how many units of each item should go into the knapsack to maximize the total benefit. (To earn full credit, please explain the steps of your calculation clearly. For example, if you introduce an auxilliary function or table, you need to give its definition and state how you calculate them.) [15pt] Table 1: table Item (n) Weight (Wn) Benefit (bn) Items for the knapsack problem. 100 75 50