Suppose we select 4 students from the class to play the following game: . I give each student one (infinitely divisible) dollar. Each student chooses (simultaneously) how much of their dollar to put into a common fund. . I multiply whatever is in the common fund by 3, and distribute the total equally among the 4 students. . Let r; denote player i's strategy in this game, so that 0 0 is strictly dominated by choosing r; = 0. (c) Now suppose that the game described is a stage game for a repeated game with a discount factor 6. The game is repeated using the same 4 students, we do not select new students each stage, with each player receiving $1 at the start of every stage. No matter how much a player currently has, they can only choose how much of the dollar they just received to put into the common fund. Define a "trigger-type" strategy oy as follows: . Begin by contributing y > 0 in stage 0 (0