II. Graphical LP Solution Solve the following problem. Consider the following example 1 Maximize z subject to 3x1 + 9x2 4x1 + 2x2 0 The line that represents the ist constraint is: 20 -15 10 -5 -10 -5 0 5 15 20 25 -5 -10 -15 The "Green" line O The "Blue" line The "Red" line None of the above * The line that represents the 2nd constraint is: 20 -15 -10 5 -10 -5 0 5 15 20 25 -5 -10 -15 The "Green" line The "Blue" line The "Red" line None of the above The line that represents the 3rd constraint is: 20 15 10 -10 -5 0 5 15 20 25 5 -10 15 O The "Green" line The "Blue" line The "Red" line None of the above After shading to constraint lines, the feasible space is * 20 154 -10 -10 -5 0 5 10 15 20 25 -5 -10 15 The "Green" area The "Pink" area O The "Blue" area The "Yellow" area