1.Use branch-and-bound to solve the following IP problem.This problem must be solved in graphical approach.Max Z = 5X1 + 2X2S.T. 3X1 + X2 <= 12X1 + X2 <=5X1 >= 0, X2>=0X1 and X2 are integer2 – A manufacturer can sell product 1 at a profit of $2/unit...