Solve the following linear programming problem graphically: Maximize Z = 4X, +4X2 Subject to: 3X, +5X2 5 150 X4 - 2X, S10 5X, +3X2 s 150 X. X 20 1) Using the line drawing tool, plot the constraints by picking two endpoints for each line. Do not plot the nonnegativity constraints. 2) Using the point drawing tool, plot the five corner points which define the feasible region. The optimal solution is Xy - and X2 - (round your responses to two decimal places). Maximum profit is $ (enter your response as a whole number)