Q$4(25$ pts$)$ Determine the items to be selected to fill a knapsack of capacity $5$ lbs so that the total $ value of the items collected is maximized. An item can be either selected or not $(0-1$ Knapsack problem$).$

Use the multi$-$stage graph largest weight path approach.

$\backslash$table$[[$Item$,\backslash$table$[[$Weight$],[$Ib$]],\backslash$table$[[$Value$]]],[1,3,30],[2,1,20],[3,2,35],[4,4,42]]$