Consider the following LP:

max,$x_1,+x_2$

$s.t.x_1,$

$,-x_1,+x_{2}2$

$,x_1,x_2,0$

This linear programming problem is $a(n)$ :

Hint: draw the feasible region.

infeasible problem.

problem with multiple optimal solutions.

bounded problem with an unique optimal solution.

Unbounded problem.