bmit one pdf file to answer each question. Q2 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: on Item 1 2 3 4 Weight 15 10 10 4. Value $900 $580 $580 $180 Find the most valuable subset of the items that fits into the knapsack using Greedy Approach. Maximum file size: 200MB, maximum number of files: 1 - Files F6 Fs FO F10 & 8 he SEVEN (7) questions. mit one pdf file to answer each question. Q3 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. on b) Compare your answer for Q3a) with Q2, and explain the difference and the cause for the difference (if any). Maximum file size: 200MB, maximum number of files: 1 Files F6 F7 ele FB F10 s F12 2 &