plz answer me in detail thx!!

1 Perturbed Matching Coins Last class, we have introduced the concept of Bayesian Games, that is, static games of incomplete information, as well as the notion of a Bayesian Nash equilibrium, and solved a related nature game involving two rms: an entrant choosing either to enter or not and an incumbent with private (high or low) costs of building a new plant. Now it is time to get a scoop on how to perturb old known classic games! Now consider the following perturbation on the one-stage \"Matching Coins\". Players 1 and 2 simultaneously choose the side (heads (H) or tails (T)) of a two-faced coin, and the combined outcome either gives to or takes from each player some amount of Euros, as in the next. If the choices match heads (H), then player 1 gets 1 + 61 and player 2 loses 1. If the choices match tails (T), then player 1 gains 1 and player 2 loses 1. For different choices (T, H), it is player 2 who gets 1 + 99 and player 1 who loses 1, and for distinct choices (H,T), then player 2 wins 1 and player 1 loses 1. For i 6 {1,2}, player i's type 65 is uniformly distributed in [19, 9]. Each player knows its type 9,- but it does not know the other player's type. II\" [ill-- -_-I Table 1: Perturbed Matching Coins Game. Let's check that the symmetric pure-strategies, (3,(6, 2 0) = H, s,(9,~