For each two-player zero-sum game, (a) write each player's LP (player I and player II) (b) for each player, give a point that is feasible, but not optimal (c) for each player, find the best guarantee that is possible using only pure strategies (d) solve each game graphically (i.e., find optimal strategies for both players and the value of the game). (e) solve each game by the table method (remember that player II's best response is the smallest number!) 1) 2) -2 3 2 3 -1 4 0 -4 2 1. -4 1 For each two-player zero-sum game, (a) write each player's LP (player I and player II) (b) for each player, give a point that is feasible, but not optimal (c) for each player, find the best guarantee that is possible using only pure strategies (d) solve each game graphically (i.e., find optimal strategies for both players and the value of the game). (e) solve each game by the table method (remember that player II's best response is the smallest number!) 1) 2) -2 3 2 3 -1 4 0 -4 2 1. -4 1