(Solved): Please solve with python Knapsack Problem Example of a one-dimensional knapsack problem: In Fig. 1 ...

Please solve with python

Knapsack Problem Example of a one-dimensional knapsack problem: In Fig. 1, which boxes should be placed in the bag to maximize the value (amount of money) while keeping the overall weight under or equal to \( 15 \mathrm{~kg} \) ? Solution: 1. If any number of each box is available, then three yellow boxes and three grey boxes 2. If only one of the shown boxes are available, then all but the green box. In all the exercises in this Lab we will assume that only one item of each type is available. (Case 2 above). Exercise 7: Write a code using Dynamic Programming to solve the problem shown in Fig. 1. The code should perform these tasks: 1. Read input.txt (generated in Exercise 1). 2. Construct a table using dynamic programming approach (as generated in Exercise 6). 3. Write a code to generate the solution.txt file (As shown in Exercise 2) based on the table generated in step 2.