1. Consider any two player game that has a strategically dominant solution for one player but not the other. Prove or disprove that all such games have a Nash equilibrium among the set of pure strategies. Remember that pure strategies are the ones listed in the payoff matrix, not those created by probabilities.
2. Consider the following version of the game of Chicken.
P1/P2 C     D
   C (3,3) (2,4)
   D (4,2) (1,1)
a. ( 11 points) What is the set of feasible and enforceable average payoffs?
b. ( 11 points) Create a Nash equilibrium solution pair that yields an average payoff of 2.5 for player 1 and 3.5
for player 2. Justify that it is a Nash equilbrium.