Question

Apply dynamic programming approach to compute the maximum profit for the
following instance of knapsack problem.

N= 4, Profit= {1,2,5,6}, Weight = {2,3,4,5}