Linear programming problem. Please include all the steps.

1 For a zero-sum game with the following payoff table Player 2 Strategy 2 3 Player 1 1 4 3 2 0 (a) Find a LP problem and its dual LP problem for the minimax problem for the corresponding zero- sum game. (b) For the easier LP problem, set up the initial tabular form by the Big-M method. (c) Find only the initial tableau (feasible echelon form) for the Big-M method and the corresponding feasible corner point. No need to find the subsequent tableaus