Write a program to perform the 0/1 knapsack problem given the following information.
n=4 (# of elements)
W = 5 (max
weight)
Elements (weight, benefit):
(2,3), (3,4), (4,5), (5,6)
And find the optimal knapsack.
Answers
Answered by
0
Answer:
I don't know dear
Explanation:
Similar questions