Does the following linear program involve infeassibility, unboundness, and$/$or alternative optimal solutions? Explain by Graph.$($Shade $).$

Max $1x_1+1x_2$

$s.t.$

$8x_1+6x_{2}24$

$4x_1+6x_2-12$

$2x_{2}4$

$x_1,x_{2}0$

Charge to given LP ento memere LP and solve by gaphe