Problem 1: Consider the two-person, zero-sum game having the following payoff table. a) Formulate the problem of finding optimal mixed strategies according to the minimax criterion as a linear programming problem. b) Use the simplex method to find these optimal mixed strategies. Note: to insure x50, add 4 to each entry of the payoff table (since the minimum value is -4)