[Solved] 20 Using Dynamic Programming Greedy Technique Solve Knapsack Problem Items Following Table Q37255043

(20%) Using dynamic programming and/or greedy technique, solve the knapsack problem with items in the following table and the capacity of the knapsack is 5 lb. Show your steps briefly. Item # 2 4 Weight (Ib.) Value (S) 2 20 60 30 50 1) If items cannot be taken as fractions, what is the best choice? 2) If items can be taken as fractions, what is the best choice? Show transcribed image text (20%) Using dynamic programming and/or greedy technique, solve the knapsack problem with items in the following table and the capacity of the knapsack is 5 lb. Show your steps briefly. Item # 2 4 Weight (Ib.) Value (S) 2 20 60 30 50 1) If items cannot be taken as fractions, what is the best choice? 2) If items can be taken as fractions, what is the best choice?

Expert Answer

---

Answer to (20%) Using dynamic programming and/or greedy technique, solve the knapsack problem with items in the following table an… . . .