$1\mathrm{.}1$ Problem $1[15$ pts $]$

Problem $1.$ Consider the following input for the Knapsack problem with a capacity $\backslash ($ W$=11\backslash )$ :

and the corresponding table for the optimal values$/$profits:

Draw the backward path consisting of backward edges to find the subset of items that has the optimal value$/$profit$.$ Besides indicating the backward path, you must also give the optimal$-$value subset of items. Clearly explain your work.

Angmer