Continuation of Problem 2

(a)What is the best upper bound we have on the maximum value of Z for the integer program at this stage?(b)What is the best lower bound we have on the maximum Z value?(c)Indicate the node(s) that have been fathomed and explain why?(d)Identify the node(s) that have not been fathomed and explain why not?(e)Have we reached an optimal solution to the integer program? Why or why not?

Problem 2 During the maximization of a pure integer-programming problem by the branch and bound algorithm, we have the following branch and bound tree at a certain stage. Z = 100 (Continuous solution) Z = 91 Z = 35 (Continuous solution) (Continuous solution) Z = 75 Z = 60 (Continuous (Integer solution) solution) Z = 70 Z = 79 (Integer (Continuous solution) solution) Z = 65 (Continuous solution) Infeasible solution