Solve the following problem manually using the B&B algorithm. You can use the

computer to solve the individual problems generated. Create a branch$-$and$-$bound

tree to display the steps you complete.

MAX: $6x_1+8x_2$

Subject $to$: $6x_1+3x_{2}18$

$,2x_1+3x_{2}9$

$,x_1,x_{2}0$

$x_1,x_2$ must be integers