Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively.

Maximize Z 3x1 4x2 2x3 x4 2x5, subject to 2x1  x2 x3 x4 x5  3

x1 3x2 x3  x4  2x5  2 2x1 x2  x3 x4 3x5  1 and xj  0, for j 1, 2, 3, 4, 5 xj is binary, for j 1, 2, 3.