2. Consider the game having the following payoff table: Player 2 Strategy T1 T2 T3 S4 2-3 Player 1 S2 -1 0 3 (a) (points: 5) Formulate the problem of finding an optimal mixed strategy for player 1 according to the max-min criterion as a linear programming problem. What is the optimal strategy for player 1, and what is the optimal payoff? (b) (points: 5) Formulate the problem of finding an optimal mixed strategy for player 2 according to the min-max criterion as a linear programming problem. What is the optimal strategy for player 2, and what is the optimal payoff? Remark: You can use Excel to solve the two LPs, or other methods to solve them. Explain very briefly how you solve them (one or two sentences); no need to provide detailed procedure