Solve the knapsack problem using Dynamic Programming and find the maximum value that can be put in a Knapsack bag. Knapsack capacity 6
Item weight value
1. 3. 30
2. 2. 25
3. 4. 30
4. 2. 20
5. 1. 35
Answers
Answered by
0
Solve the knapsack problem using Dynamic Programming and find the maximum value that can be put in a Knapsack bag. Knapsack capacity 6
Item weight value
Answer :- 1. 3. 30
Similar questions