Consider a guessing game with ten players, numbered 1 through 10. Simultaneously and independently, the players select integers between 0 and 10. Thus player i’s strategy space is Si = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, for i = 1, 2, c, 10. The payoffs are determined as follows: First, the average of the players’ selections is calculated and denoted a. That isa = (s1 + s2 + ... + s9 + s10)/10where s_{i} denotes player i’s selection, for i = 1, 2, · · · , 10. Then player i’s payo? is given by u_{i} = (a-i-1)s_{i}What is the set of rationalizable strategies for each player in this game?