asap)) plz explain by using graph

Consider the following linear program (LP):

Which of the following are true?

Note: For these problems the LP is similar except the constraints may change from "greater-than-or-equal to" to "less-than-or-equal to" or vice versa. For each problem, check your constraints and the feasible region carefully.

There is an optimal solution to this problem.

There is no feasible solution to this LP.

There are two feasible corner points in this problem.

This LP has an unbounded feasible region.

Exactly two of these answers are correct.

Max Z = - 3*x + 4*y subject to - x + y 2 1 1 2*x - y > 2 x + y 2 4 x, y20