Solve the following IP problem using Branch and Bound algorithm. Maximize: z= 5x1 + 6x2 Subject to: X1 + X2 0 and integer 2 a) What are the values of decision variables and the objective function at the optimal solution to the given IP? b) Label each sub problem and indicate the values of the variables and the objective function for each subproblem. c) Draw the branch and bound tree and indicate any nodes that are fathomed, lower bound or upper bound