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