Consider the following 4 items with their values and weights given below. Suppose the capacity of knapsack is 10 . Using dynamic programming approach, find the maximum value of items to be put in the knapsack. Also find the items to be put in the knapsack. Capacity of knapsack, W=10 (Show all of your calculations in detail. Without calculations, you will lose marks) Solution: Items Chosen ={}