Consider the following linear programming model

Max $2x_1+3x_2$

Subject to:

$x_1+x_{2}4$

$x_{1}2$

$x_1,x_{2}0$

This linear programming model has:

A$)$ redundant constraints

B$)$ infeasible solution

C$)$ alternate optimal solution

D$)$ unique solution

E$)$ unbounded solution

Answer: