Solve the below:
Q: A linear programming problem has three constraints, plus nonnegativity constraints on X and Y. The constraints are: 2X + 10Y lessthan or equal to 100; 4X + 6Y less than or equal to 120; 6X + 3Y greaterthanorequalto 90. What is the largest quantity of X that can be made without violating any of these constraints?