Solve the following linear programming problem graphically: Maximize Z = 4X, +4X2 Subject to: 3X, +5X2 S 150 X4 - 2x2 5 10 5X, +3X, 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 X, -and X=(round your responses to two X decimal places) Maximum profit is $(enter your response as a whole number). 50- 40 Solve the following linear programming problem graphically Maximize Z=4X, +4x3 Subject to 3X, + 5X, 5150 Xy - 2X, 510 5X, +3X, s 150 x, xz 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 30 20 10 The optimal solution is X, - und X; - cround your responses to two decimal places) Maximum profit is contor your response as a whole number). 0 O 20 30 40 10 (4.03,26.7) C