Which of the following problems is equivalent to the 0-1 Knapsack problem?

• A. You are given a bag that can carry a maximum weight of W. You are given N items which have a weight of {w1, w2, w3,‚Äö√Ñ√∂‚àö√묨‚àÇ., wn} and a value of {v1, v2, v3,‚Äö√Ñ√∂‚àö√묨‚àÇ., vn}. You can break the items into smaller pieces. Choose the items in such a way that you get the maximum value
• B. You are studying for an exam and you have to study N questions. The questions take {t1, t2, t3,‚Äö√Ñ√∂‚àö√묨‚àÇ., tn} time(in hours) and carry {m1, m2, m3,‚Äö√Ñ√∂‚àö√묨‚àÇ., mn} marks. You can study for a maximum of T hours. You can either study a question or leave it. Choose the questions in such a way that your score is maximized
• C. You are given infinite coins of denominations {v1, v2, v3,‚Äö√Ñ√∂‚àö√묨‚àÇ.., vn} and a sum S. You have to find the minimum number of coins required to get the sum S
• D. None of the mentioned