A 50- Q 40- LY Solve the following linear programming problem graphically: Maximize Z = 4X, +4X2 Subject to: 3X, +5X2 5 150 X1 - 2X2 5 10 5X, +3X2 s 150 X, X220 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. 30- 20- 10- and X2 = (round your responses to two The optimal solution is X1 = decimal places). X1 0 0 10 20 30 40 50 Maximum profit is $ (enter your response as a whole number)