Sulset Total weight Total value 0 $0 7 542 1 $12 4 5 10 554 11 Botanite 12 Botanile 7 552 3 537 525 11.21 1.31 11.41 12.11 18.4 11.2. 11,2,4 olanie est faible tot faible sic it canille 15 16 12 19 12.3.4 11.2.1.4 5] Solve the following Knapsack problem by exhaustive search: Weights: w = {4, 6, 2,8) Values: v = { 40, 50, 30,70 } Knapsack Capacity: W = 12 Sur Total weight Total value SD 540 4 121 554 11 L2.31 14 21 12 19 FIGURE BB Insulak bumi in our The triarai ataut the earlalar hin all Remember the steps: generate all the subsets of the set of n items given (already solved!) compute the total weight of each subset identify feasible subsets (the ones with the total weight not exceeding the knapsack capacity w find a subset of the largest value among them.