Question $5[10$ marks$]$

When using Backtracking to solve the $\backslash (0/1\backslash )$ Knapsack problem, each node of the state space solution tree contains $3$ numbers: i$)$ the profit accumulated, ii$)$ the weight accumulated, and iii$)$ the upper bound for this node $($calculated by solving the problem, from this node on$,$ as if it was a fractional knapsack one$).$ Given the same $\backslash (0/1\backslash )$ Knapsack instance as in question $3$ above, solve it using the Backtracking technique by drawing the pruned state space tree solution and giving the maximum profit, and which objects will be chosen. Do not forget to sort first if you need to$!$

Max Profit $=$

Objects chosen :