Problem 4 (10pt.) Solve the following integer program with integer variables using branch and bound. Draw the tree and show how the algorithm progress at each node. min 5x1 + x2 + x3 + 2x4 + 3x5 s.t. x25x3 + x4 + 2x5 ≥ 10 5x1-x2+x5≥7 x1 + x2+6x3 + x4 ≥4 X1, X2, X3 € Z+ X4, X5 ≥0.

Fig: 1