consider the following normal-form game: 2 l c r 1 u 4, 11 3, 5 6, 12 m 2, 4 1, 8 5, 6 d 3, 10 4, 7 3, 8 a. is there a strictly dominant strategy for some player? b. are there strictly dominated strategies for some player? find them all. c. find the set of outcomes that survive the process of iterative elimination of strictly dominated strategies. is the game solvable?