Let A = (aij ) be an m n payoff matrix of a two person zero sum game.a) Assume that the average entry in column j of A is at least 5 for each j = 1, 2, . . . , n. Show thatthe assured (expected) winnings for the row player (player 1) is at least 5.b) Find an example such that the average entry in A is at least 5 (the average over all mn entries)and yet there is a strategy for the column player (player 2) so that the winnings for the row player(player 1) are at most 4.