Q1: (30) An assembly line problem is given below having the cost for each station Solve the problem using Dynamic Programming method Q2: (30) Consider the problem having weights and profits are: Weights: {1,2,5,6} Profits: {2,3,1,4} The capacity of the knapsack is 8kg The number of items is 4 You have to solve the 0/1 knapsack problem using Dynamic programming. Deadline: 23-1-2023 (Monday) Q1: (30) An assembly line problem is given below having the cost for each station Solve the problem using Dynamic Programming method Q2: (30) Consider the problem having weights and profits are: Weights: {1,2,5,6} Profits: {2,3,1,4} The capacity of the knapsack is 8kg The number of items is 4 You have to solve the 0/1 knapsack problem using Dynamic programming. Deadline: 23-1-2023 (Monday)