Consider the following linear program:

MAxz$=5x+3y$

$s.t.x-y6$

$x1$

The optimal solution:

is unbounded.

is infeasible.

occurs where $x=0$ and $y=1.$

occurs where $x=1$ and $y=0$