Use the BIP branch$-$and$-$bound algorithm presented in Sec. $12\mathrm{.}6$ to solve the following

problem interactively:

Maximize $Z=5x_1+5x_2+8x_3-2x_4-4x_5,$

subject to

$-3x_1+6x_2-7x_3+9x_4+9x_{5}10$

$x_1+2x_2-x_4-3x_{5}0$

and

$x_j$ is binary, $,$ for $j=1,2,$dots,$5.$