Problem 3 (10pt.) Solve the following integer program with binary variables using branch and bound. Draw the tree and show how the algorithm progress at each node. max s.t. 5x15x2+8x3 - 2x4 - 4x5 - 3x1+6x27x3+9x4 +9x5 ≥ 10 x12x2x43x5 ≤0 X1, X2, X3, X4, X5 = {0,1}.

Fig: 1