Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack=40. Find the maximum value output assuming items to be divisible and nondivisible respectively.
(a) 100, 80
(b) 110, 70
(c) 130, 110
(d) 110, 80
I got this question in an online quiz.
Question is taken from Greedy Algorithms in portion Greedy Algorithms of Data Structures & Algorithms II