Solve the following linear programming problem graphically: Maximize Z = 4X+4X2 Subject to: 3X, +5X, S 150 X4 -2X2 5 10 5X, +3Xs 150 Xq, 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 comer points which define the feasible region The optimal solution is X1 = and X2 = (round your responses to two decimal places) Maximum profit is $(enter your response as a whole number) 0 150 40 130 201 10. 10 120 50