Consider a knapsack problem. We have given a knapsack of capacity M and objects are present in two sets A and B. Each object of both sets has weight and profit corresponding to it. However, the objects are selected in sequence order. At first an object from set A then an object from set B and this order is repeated. Provide the solution to knapsack problem using Greedy method for the followings. Assume the fractional object selection is allowed. Capacity of the knapsack is 25, Set A: Object Weight Profit A1 10 100 A2 5 28 A3 9 16 A4 3 71 A5 11 14 Set B: Object Weight Profit B1 7 90 B2 15 4 B3 2 55 B4 31 200 B5 14 41 Represent the knapsack diagrammatically showing which all objects are selected into it. Compute the maximum profit achieved