Use the Graphical Method for Linear Programming to Find the Optimal

Multiple Choice

Use the graphical method for linear programming to find the optimal solution for the following problem.
Minimize C = 3x + 15y
subject to $2 x + 4 y \geq 12$
$~~~~~~~~~~~~~~5 x + 2 y \geq 10$
And x ? 0, y ? 0.

A) (x, y) = (0, 0) .
B) (x, y) = (0, 3) .
C) (x, y) = (0, 5) .
D) (x, y) = (1, 2.5) .
E) (x, y) = (6, 0) .