Question 5 Consider the following partial Branch and Bound tree for a Maximization Pure Binary Integer Programming Problem where all variables are nonnegative integers. Note that the number in the circle is the optimal value of the Linear Programming Relaxation and the solution attached to the circle is the optimal solution of the Linear Programming Relaxation. 30.3 (0.40, 0.10, 1, 0.65) x=0 x=1 (1, 0.33, 0.88, 1) -0.4 27.2 (1, 0.40, 0.30, 0.25) x=0, x=1 (0, 0, 1, 0) 23.3 28.5 (1, 1, 0.04, 1) The above Branch and Bound tree seems to be incorrect. Identify ALL mistakes with this tree. For each mistake, use two sentences to explain why. [20]