$5$

Consider the following linear program.

Max $1A+1B$

$s.t.$

$,4A+3B24$

$,2B6$

$,A,B0$

Does the linear program involve infeasibility, unbounded, and$/$or alternative optimal solutions? $($Select all that apply.$)$

infeasibility

unbounded

alternative optimal solutions

Explain. $($Select all that apply.$)$

The second constraint allows the solution to be made infinitely large.

The first constraint allows the solution to be made infinitely large.

There are more than one solution for A and $B$ which produce the optimal value for $1A+1B.$

The regions defined by the constraints do not overlap.