Consider the following input to the $0/1$ knapsack problem, for a knapsack that can hold at most W$=11$

pounds:

Use dynamic programming $($tabulation$)$ to find the optimal solution for the input above and show which items belong in the optimal solution.

Item, i $12345$

Value, vi $16182228$

Weight, wi $12567$

Fill in the table