on Consider the following game, where both players 1 and 2 have 3 possible moves, respectively di, i = 1, 2, 3, and dj, j = 1, 2, 3, with the following payoff matrix: 81 82 83 d₁ (2,5) (0,10) (0,7) d2 (7,6) (9,6) (0,3) d3 (3,2) (8,7) (0,6) How many Pareto optimal pairs are there in this game? O a. 4 O b. 1 О с. 0 O d. 2 O e. 3 O f. 6 O g. 8 Oh. 7 Oi. 5 Oj. 9 Consider a game between player A with a choice between moves d₁, d2 and d3, and player B with a choice between 81, 82 and 83, and the following pay-off matrix: 81 82 83 di (6,6) (1,7) (4,10) d2 (5,4) (2,1) (8,9) d3 (10,5) (7,2) (3,3) Is that game solvable? In which sense? O a. The game is not Nash solvable, solvable in the strict sense and completely weak sense. O b. O c. The game is Nash solvable, also solvable in the strict sense but not completely weak sense. The game is Nash solvable, also solvable in the completely weak sense but not strict sense. The game is not solvable in any sense. O d. O e. The game is only solvable in the strict sense, not in the Nash sense nor completety weak sense. The game is solvable in the Nash sense, as well as strict and completely weak sense. The game is only solvable in the completety weak sense, not in the strict sense nor Nash sense The game is only solvable in the Nash sense, not in the strict sense nor completety weak sense. O f. O g. Oh.