Linear programming problem. Please include all the steps.

1 (5 points). For a zero-sum game with the following payoff table Player 2 Strategy 1 2 3 Player 1 1 4 3 1 2 0 -1 2 (a) Eliminate any inferior strategy for Player 2, and find the revised payoff table for Player 1 if appli- cable. (b) Use the graphical method to find the optimal mixed strategies for both players. (c) Construct a payoff table for Player 2. Use only the first part of the graphical method for Player 2 to find its optimal mixed strategy to confirm the answer from (b)