. Given some items, pack the knapsack to get the maximum total value. Each item has some weight and some value. Total weight that we can carry is no more than some fixed number W. So, we must consider weights of items as well as their values. Items are indivisible; you either take an item or not. Considering Weights = {3,4,6,5} Profits = (2,3,1,4} W= 8, n=4 Solved the problem with dynamic programming. Draw the look-up table, based on the Dynamic Programming method, for the 0-1 knapsack problem. Provide the final optimal solution, too