Use the following scenario and data for questions $11$ to $20$

The following linear programming problem can be solved with the graphic method. The lines for the constraints have been drawn. You are required to finish the graph and then answer the following questions.

min $4$x$1+20$ x$2$

s$.$t$.7$x$1+2$x$2>=14$

$5$x$1+6$ x$2>=30$

$2$x$1+10$x$2>=20$

x$1,$x$2>=0$

$18.$ The point $(10,0)$ is

$$ feasible but not optimal.

$$ an optimal solution.

$$ infeasible.

$$ not on the boundary of the feasible region.

$$ none of the above.