Given the following mathematical program:

MaxZ$=2^{**}x+2^{**}y$

subject to

$x+2**y3$

$2**x+,y5$

$x,y0,x,y$ integer

Which of the following are true?

The optimal solution value for this problem is strictly less than the optimal solution value for the corresponding linear programming relaxation.

$(x,y)=(2\mathrm{.}0,1\mathrm{.}0)$ is a feasible solution for this problem.

The optimal solution for this problem occurs at a feasible corner point for the linear programming relaxation.

None of the answers are correct.

The linear programming relaxation for this problem has $3$ feasible corner points.