You are given the following linear programming model in algebraic form, with x1and x2as decision variables. Maximize 3x1 + 2x2 Subject to 2x1 + 2x2 8 x1 + 0.5x2 3 x1 , x2 0 Now solve this problem using the algebraic/graphical method. Specifically, answer the following four parts.

(a) Graph the feasible region and label the corner points.

(b)Compute the optimal solution using any method of your choice. Justify your answer and indicate the optimal solution on your graph.

(c) There are four constraints in this problem: 2x1 + 2x2 8, x1 + 0.5x2 3, x1 0, and x2 0. Identify which are binding and which are non-binding. Why? Explain