Consider the following instance of 0-1 Knapsack problem: Item 11 12 13 14 15 Profit 9 6 7 5 9 Weight 5 7 4 5 8 The maximum weight of 16 Kg is allowed in the knapsack. The assumption is that each time an item is either taken completely or is left behind; she cannot take a fractional amount of an item or take an item more than once. Given the above set-up, using BRANCH AND BOUND methodology pick a subset of these items such that their total weight is no more than 16 kg and their total value is maximized