The following branch and bound tree is obtained when solving a mixed integer linear problem (maximization), where z denotes the objective function value of the corresponding subproblem, and for the three variables of the problem we have x1 R, x2 Z, and x3 {0, 1}.

Can the branch and bound procedure stopped at this point? Explain your answer. If you think the procedure can be stopped, give an optimal solution; if you think the procedure is not completed, describe how it should proceed.

4. The following branch and bound tree is obtained when solving a mixed integer linear problem (maximization), where z denotes the objective function value of the corresponding subproblem, and for the three variables of the problem we have x1R,x2Z, and x3{0,1}. Can the branch and bound procedure stopped at this point? Explain your answer. If you think the procedure can be stopped, give an optimal solution; if you think the procedure is not completed, describe how it should proceed