X7 (A). let suppose you have four objects with weights and profits given below. Objects: {x1, X2, X3, X4 X5 X6 Weights (kg): {22 24 4 36 13 7 Profits: {13 25 2 8 3 11 12 X8} 1} 9} 5 You need to get maximum profit within the weight limit of the box. However, the box can only have 36 kg objects. Use tabular method (0/1 Knapsack problem of dynamic programming) to get maximum profit