solve it on paper do not use any program

Consider the following IP: Min Z = X1 + X2 Subject to 2X1 +5X2016 6X1 + 5X2 127 X1, X2 = 0; X1, X2 integer. Use the Brunch and bound algorithm to find the optimal solution. For convenience, always select Xias the branching variable at node 0 b) Repeat problem, assuming that X1 is continuous. Problem 4 (b) Show graphically that the following IP has no feasible solution, and then verify the result using Brunch and bound algorithm Min Z = X1 + 2 X2+5X3 Subject to |-X1 +10X2-3x3 | 215 2X1+ X2+X3X10 X1, X2, X320