Consider the following LP: maximize 2x1 + 2x2 subject to x1 +2x26 2x1 + x2 6 x24 21 < 4 x1, x2 0 Solve this LP graphically. Use the following plot to fill in the blanks below. x2 A 6 5 B E I 4 3 2 J 1 D G H 0 1 2 3 4 56 x1 Solve this LP graphically. Use the following plot to fill in the blanks below. Is the yellow area (EFJI) a part of the feasible region? Is the red area (CDGF) a part of the feasible region? Is the blue area (FGHJ) a part of the feasible region? Is the green area (BCFE) a part of the feasible region? How many basic feasible solutions does this problem have? The basic feasible solution in which the slack variables for the first and the second constraints are nonbasic is given by point The basic feasible solution in which the slack variables of the third and the fourth constraint are the nonbasic variables is given by point The optimal solution of this LP is given by: x1 z*=