Please help me with these.

Consider the following static Prisoner's Dilemma game. CE 0 2,2- D ram 1. Are there any strictly dominated strategies? Find all the pure strategy Nash Equilibria. For the following parts, suppose this game is played for innitely many times with discount factor for both players 5 E [0,1]. 2. Suppose 6 = 0, nd all the SPNE(s). 3. Let both players adopt the following strategy: start with cooperation; cooperate as long as no one has ever dejected before,- othenmse defect. Find the minimum value of 15 such that this is a SPN E. 1Use the [in]: provided in the class' mouclle site to submit this problem set. 4. For this part alone, suppose the payoff matrix for the original static game has been changed to: I- D 1 m- a, How does your answer to part 3 change? [3 the new minimum value of 6 larger or smaller? Explain. 5. Let both players adopt the following strategy: start with. cooperation; cooperate if both players cooperated or both players defected tn the previous period; defect if one player defected and another player cooperated in the previous period. In other words, the punishment for deviating from cooperation only lasts for one periodI and both players revert to cooperation immediately after. Is it a SPNE if 6 = 3,15? What if d 2 U3? 4 0 6. Suppose d = 1,54. Before the game starts, you tell the players that you will offer each of them money In > 0 at each period both of them cooperate. At least how much should you offer to make the strategy described in part 5 a SPNE