5. The figure below depicts an incomplete branch and bound tree to maximize a MIP, with numbers next to nodes indicating LP relaxation solution values 0 240 3 201 1) 212 2 210 4 by solving Node 4 has just produced the first incumbent solution, and nodes a to d remain unexplored. (a) Show which unexplored nodes could be immediately fathomed if the incumbent at node 4 had objective function value 205. How about 210? (b) Determine the best upper bound on the ultimate MIP optimal value that is available after processing of node 4 (c) Assuming the incumbent at node 4 has objective value 195, compute the maximum absolute and percent objective value error in accepting the incumbent as an approximte optimum 5. The figure below depicts an incomplete branch and bound tree to maximize a MIP, with numbers next to nodes indicating LP relaxation solution values 0 240 3 201 1) 212 2 210 4 by solving Node 4 has just produced the first incumbent solution, and nodes a to d remain unexplored. (a) Show which unexplored nodes could be immediately fathomed if the incumbent at node 4 had objective function value 205. How about 210? (b) Determine the best upper bound on the ultimate MIP optimal value that is available after processing of node 4 (c) Assuming the incumbent at node 4 has objective value 195, compute the maximum absolute and percent objective value error in accepting the incumbent as an approximte optimum