03 a) For the instance of discrete knapsack problem given in Q3, use branch-and-bound problem-solving technique to find the most valuable subset of items that fit into this knapsack. You must show all the steps in applying the technique. In your state-space tree constructed for solving this problem, you must number all the nodes according to the sequence that they are created clearly. b) Compare your answer for Q3a) with Q2, and explain the difference and the cause for the difference (if any). 03 a) For the instance of discrete knapsack problem given in Q3, use branch-and-bound problem-solving technique to find the most valuable subset of items that fit into this knapsack. You must show all the steps in applying the technique. In your state-space tree constructed for solving this problem, you must number all the nodes according to the sequence that they are created clearly. b) Compare your answer for Q3a) with Q2, and explain the difference and the cause for the difference (if any)