Problem 1: Solve the following linear program using the graphical solution approach. In solving the problem, please do the following: 1. Label all constraints and the feasible region. 2. Draw contour lines to represent the objective function. 3. Illustrate the objective direction. (Which way are we trying to move the contour line?) 4. Indicate (a) whether or not the problem is feasible, (b) whether or not the problem has an optimal solution, and (c) whether or not the problem is unbounded. 5. Label all optimal solutions. 6. If there is a unique optimal solution, compute the variable values and the objective value for this optimal solution. If there are alternative optimal solutions, compute the variable and objective values for three optimal solutions. min 2x1 + x2 3x1 + 2x2 > 13 1 s.t. X1 > 3 X1 + x2 >7 X1, X2 > 0