Problem 2 - You are given the following linear program: Max 2x + 3x2 s.t. -3X1 + X2 51 4xy + 2x2 s 20 4x4 - X2 S 10 X1 - 2x2 2-5 X1, X220 a) Solve this problem graphically. b) Introduce slack, surplus, and artificial variables as required to put the problem into standard/canonical form. c) Apply the simplex algorithm to solve it and find the optimal solution starting from the trivial initial solution where all the deviation variables are in the base (detail the iterations); Note: You may use either the tableau or dictionary representation according to your preference. d) Is the optimal solution unique? How can one determine this? e) Identify on your graphic of question (a) the trajectory of the algorithm