(10 marks) Use the Backtracking algorithm for the 0-1 Knapsack problem to maximize the profit for the following problem instance. Show the pruned state space tree produced by using the Backtracking algorithm. Specify the 'profit', weight' and 'bound' from top to bottom at each node in the pruned state space tree (6 marks). Mark each nonpromising node with a cross (2 marks). Mark the node(s) with optimal solution (2 marks) 1 $40 2 $60 10 3 $70 14 4 $24 6 5 $6 2 W 18