Problem $11-3$

Consider the following all$-$integer linear program:

Max$1x_1+1x_2$

s$.$t$.$

$4x_1+6x_{2}22$

$1x_1+5x_{2}15$

$2x_1+1x_{2}9$

$x_1,x_{2}0$ and integer

a$.$ Choose the correct graph which shows the constraints for this problem and uses dots to indicate all feasible integer solutions.

$($i$)$

ii$)$