urgenttt

Let S = {11, 12, 13, 14, 15, 16, 17} be a collection of items with (weight, values) pairs: Item Weight Value 11 2 1 12 1 1 2 2 1 1 1 2 5 3 8 1 1 7 13 14 16 Consider items are not divisible (cannot be broken), find a subset of items that can fit into the bag of weight capacity 6 and value of the items collected in the bag should be maximized using dynamic pro- gramming approach? Show your work