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 = 6x + 10y
subject to $2 x + 4 y \geq 12$
$\begin{array} { l } 5 x + 2 y \geq 10 \\and~~~~x \geq 0 , y \geq 0 .\end{array}$

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)