Problem 2) Consider the incomplete branch-and-bound tree below obtained when solving the following maximization problem. Max 4x1+5X2 Subject to X1+4x2 5 10 3X1-4x256 X1,X220 X1, X2 : int z* = 23.5 (Xi", X2') = (4 , 1.5) X2 22 X2 S1 z* = 18 z* = 18.3 (x1, x2") = (2, 2) (xi, x2 ) = (3.3, 1) ? ? ? ? a) Complete the branch-and-bound tree by identifying the variable to branch on next, the corresponding branching constraints, and the LP relaxation solution at each node. (10 points) b) Identify whether each leaf node in the branch-and-bound tree can be fathomed or not. Justify your answer. (3 points) c) Use the branch-and-bound tree information to find the optimal solution to the integer program. (2 points)