Consider the following instance of 0-1 Knapsack problem: Item Profit Weight 11 9 5 6 7 14 5 5 15 9 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 f these items such that their total weight is no more than 16 Kg and their total value is maximized.