Define Knapsack problem. Solve the following 0/1 Knapsack problem using dynamic programming Let n=3 , p={1,2,5), w=(2,3,4) and m=6

Knapsack Problem

• knapsack is like a container or a bag with limited weight capacity and a few items each having some weight and value.

• If we have given some items which have some weights or profits then we have to put some items in the knapsack in such a way …