lupe99392 lupe99392 08-02-2024 Computers and Technology contestada Solve the following 0/1 knapsack problem using dynamic programming. P = ( 11,21,31,33), W = (2,11,22,15) C = 40, n =4.