Consider the following L.P. Model: Maximize Subject to: Z = 30X + 10X 3X + 1X 300 1X + 1X 200 1X, 100 1X 50 X, X 20 (C) (C) (C3) (C4) Constraints, C, C, C3, and C4 have been drawn on the graph to the right. a) Using the point drawing tool, locate all the corner points for the feasible area on the graph. X2 360- 320- 280+ 240- 200+ 160- 120- 80+ 40- 0- 0 40 80 120 160 200 240 280 320 360 X1 Q