Data Structure and Algorithm:

Please write clear and explain.

Thank you.

Part a (20 points) You have a knapsack that can carry at most 5 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 Weight Value 2 7 10 Part b (15 points) Write the pseudocode: 1) for filling the dynamic programming table. 2) for reconstructing the solution