# Finding Nash Equilibria for this Bimatrix Game

Consider the following Bimatrix Game

          a        b       c       d
-----|-------------------------------------------

T       (1,4)    (4,3)   (0,2)   (1,0)

B       (2,1)    (2,4)   (3,5)   (0,6)


Find all Nash Equilibria if the game in pure strategy and mixed strategy.

My Doubt is :

1) I know in the given figure of the pure strategy equilibria the boxed values represent Best responses to the game but how to find them?

2) For pure strategy nash equilibrium find the maximum payoff in each row and each column was the rule so why do they not box the strategies of player II in (B,b) = 4 > 3 and (B,c) = 5 > 2 ?