graph the system on your own graph paper. First, decide which of the four graphs below shows the correct Graph: solution. If no region umber for any region(s) on that graph should be shaded for the uld be shaded, click No Solution lyx+2 Solve the linear programming programing by graphing and then determining which vertex maximizes the lys -2-1 objective function P = 7x + 9y . a + 2y S 10 4x + y S 12 2 20 y 2 0 What is the maximum value? P - Solve the linear programming programing by graphing and then determining which vertex minimizes the objective function G = 4x + 3y . 5x + 15y 2 15 52 + 5y 2 35 2 20 1 20 Select all regions that should be shaded. If no regions should be shaded, select No Solutic 10 11 12 13 14 15 16 No Solution What is the minimum value? G - Solve the linear programming programing by graphing and then determining which vertex maximizes the objective function M = 3x + 4y . 5x + y _ 25 2x + 3y