D$,$I $12\mathrm{.}7-10.$ Use the MIP branch$-$and$-$bound algorithm presented in Sec. $12\mathrm{.}7$ to solve the following MIP problem interactively:

Minimize $Z=5x_1+x_2+x_3+2x_4+3x_5,$

subject to

$x_2-5x_3+x_4+2x_5-2$

$5x_1-x_2+x_{5}7$

$x_1+x_2+6x_3+x_4,4$

and

$x_{j}0,$ for $j=1,2,3,4,5$

$x_{j}is$ integer, for $j=1,2,3.$

Y