A linear programming problem has three$$ constraints:

$2$X$+10$Y less than or equals $100$

$4$X$+6$Y less than or equals $120$

$6$X$+3$Y less than or equals $90$

What is the largest quantity of X that can be made without violating any of these$$ constraints?

Part $2$

A$.$

$15$

B$.$

$10$

C$.$

$30$

D$.$

$50$

E$.$

$20$