Suppose there is a feasible integer linear program $($ILP$)$ with exactly two variables, $x$ and $y,$ where the feasible region is bounded.

Which of the following are true?

The number of feasible solutions to ILP is infinite.

If the integer constraints are dropped from ILP, the resulting problem is a linear program.

$(x,y)=(1\mathrm{.}33,2)$ could be the feasible solution for ILP.

$(x,y)=(-1,-3)$ could be the optimal solution to ILP.