Indicate for each sentence whether it is true or false. Mark true with a T and false with a F. For each sentence, write a few words of justification.

In a 2x2 simultaneous-move game (with ordinal payoffs): a. All pure Nash equilibria are necessarily Pareto-efficient. b. There can be at most two pure Nash equilibria. c. There can be at most two Pareto-efficient outcomes. d. The degree of conflict increases with the number of Pareto-efficient outcomes. e. All Pareto-efficient outcomes are necessarily (pure) Nash equilibria.