Use the Backtracking algorithm for the $0-1$ Knapsack problem $($Algorithm

$5\mathrm{.}7)$ to maximize the profit for the following problem instance. Show the actions step by

step. Show tree similar to Figure $5\mathrm{.}14.$ Show each node in the state space tree. Be sure to

label each node with $($i$,$j$)$ showing the node is at level i in the tree and is the j$-$th child of the

parent node. The root is $(0,0).$ Be sure to include inside each tree node the computed Profit,

Weight, and Bound. Mark an $$X$$ on a node that is a $$dead$-$end$$ or $$non$-$promising.$$ If you

find a solution, indicate which node. $--------------------$EXPLAIN THIS