A B C D a 0,0 3,0 6,2 3,1 b 0,1 6,5 3,3 2,2 c 2,6 3,3 5,5 2,4 d 1,2 4,1 3,1 1,5 Here a,b,c,d are the four pure strategies of the row player, R, and A,B, C,D the four pure strategies of the column player, C. As usual, the row players payo appears rst in each entry in the table and the column players second. (i) Suppose Player R is rational, that is he will never play a strictly dominated strategy. Is there any strategy he will never choose? (ii) Suppose Player C is rational and knows Player R is rational. Is there any strategy she will never choose