n ed 3. [2] 0-1 Knapsack problem: Given a knapsack with maximum capacity W, and a set S consisting of n items. Each item i has some weight wi and benefit value bi (all wi and W are integer values). Problem: How to pack the knapsack to achieve maximum total value of packed items (each item must be entirely accepted or rejected). For the given n=4 (# of elements), W = 5 (max weight), Elements (weight, benefit): (2,3), (3,4), (4,5), (5,6), find the maximum possible value that can be carried in the knapsack and identify the items. 0 1 2 3 4 5 0 1 2 3 4