Solve

Maximize $z=x+3y$

$2x+5y19$

$3x-2y1$

$x,y0,$ INTEGER

using branch and bound. Use graphical$/$extreme$-$point method to solve LPs$.$ Produce the branch and bound tree, showing the

branching constraints, indicating in each note the set of feasible solutions and OS$.$

$((2\mathrm{.}263,2\mathrm{.}895))$

$2x+5y=19$

$3x-2y=1$

$(0\mathrm{.}33,0)$

Label: A

$(1,1)$

$$ Label: B

$(1\mathrm{.}667,2)$

Label: $C$

$(2,2\mathrm{.}5)$

Label: D

$((2\mathrm{.}263,2\mathrm{.}895))$

Label: E

$(3,2\mathrm{.}6)$

Label: F

$(4,2\mathrm{.}2)$

Label: G

$(4\mathrm{.}5,2)$

$$ Label:

$(5,1\mathrm{.}8)$

$$ Label: I

$(6,1\mathrm{.}4)$

$$ Label: $J$

$(9\mathrm{.}5,0)$

$$ Label: $K$