Given the following mathematical program: Min Z = 2x + 2y, subject to x + 2y >= 3, 2x + y >= 5, along with nonnegativity constraints on the two decision variables (x, y >= 0) and x and y must be integers

Which of the following are true?

a. None of the answers are correct.

b. There are a finite number of feasible solutions for this problem

c. The optimal solution must occur at a feasible corner point of the linear programming relaxation to this problem.

d. (x, y) = (1.0, 2.0) is a feasible solution.

e. This is an integer linear program.