PROBLEM: You should ANSWER this question ON an A4 sheet by indicating "PROBLEM X", where X is the question number in your online exam. If you have attempted this question, select YES in the drop-down menu Solve the following problem using the Branch and Bound method. For this problem, you should draw the full branch and bound tree. For each node of the tree, please write the optimal solution and optimal objective value for the corresponding Linear Programming relaxation. Additionally, for each subtree, please indicate which case of the branch and bound method applies (.o. fathomed, LP feasible, integer feasible, infeasible). Z 4x1 + 5x2 s.t. 3x1 10 X1 + 11 3x1 3x2