) Using dynamic programming and/or greedy technique, solve the knapsack problem with items in the following...

 

Transcribed Image Text:

) 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 # Weight (lb.) Value ($) 1 2 20 2 3 60 3 1 30 4 2 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? ) 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 # Weight (lb.) Value ($) 1 2 20 2 3 60 3 1 30 4 2 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?