1. Two players play a multistage game with two stages, the payoffs for which are given in the matrices below. Stage 1: 1, 6 4, 4 2, 1 6, 0 Stage 2: b 1, - 1 4, 4 2, 1 -2, 0 a) Construct a pair of strategies that lead to an SPE where players reach ( A, b) in the first stage of the game. b) Find the smallest o which justifies the pair of strategies in a).2. Consider a finitely repeating game G(T = 10, 6 = 0.8) with the payoffs given in the matrix below, a b D 0, 5 3, 3 B 2, 2 5, 1 a) Find all SPE of this game if there is a finite amount, or prove there is an infinite amount of SPE