You have a knapsack that can carry at most 3 units of weight. Given are the...

 

Transcribed Image Text:

You have a knapsack that can carry at most 3 units of weight. Given are the following items that you can pick and you want to maximize the total weight of chosen items. What is the maximum total value that you can obtain? Which items do you choose? Show all the steps (draw the dynamic programming table, and show how to reconstruct the solution). Item 1 2 3 4 Weight Value 1 3 3 10 1 5 2 8 Part 3.2 (15 points) Determine an LCS of "ACCB" and "CACBB" using Dynamic Programming. Show all the steps (draw the dynamic programming table, and show how to reconstruct the solution). You have a knapsack that can carry at most 3 units of weight. Given are the following items that you can pick and you want to maximize the total weight of chosen items. What is the maximum total value that you can obtain? Which items do you choose? Show all the steps (draw the dynamic programming table, and show how to reconstruct the solution). Item 1 2 3 4 Weight Value 1 3 3 10 1 5 2 8 Part 3.2 (15 points) Determine an LCS of "ACCB" and "CACBB" using Dynamic Programming. Show all the steps (draw the dynamic programming table, and show how to reconstruct the solution).