Answer the questions below that correspond to the following multi-player game: Players: 1, 2, 3 Strategies: 1 (cooperate), 0 (defect) Payoffs: every player gets 2 for every cooperator (including you); the cost of a player's cooperation is zero You have to reconstruct the payoff matrix for this game. Insert the correct numbers in place of abc etc. without using commas. Example: xyz 000 (this is actually the correct number since every player gets zero in benets and pays zero in cost for cooperating) (1) abc (2) def Answer the questions below (answer T or F): (9) The highest payoff for Player 3 is 6 (10) For Player 1, cooperation is dominant (11) Player 2 is indifferent between her strategies (12) When everybody cooperates, the players receive the lowest payoffs