2. An object is to be allocated among in agents, where ny 3. For each agent i = N = {1, 2,...,n}, the value of the object is 2; [0,00), where 2 > 2 > ... > 2.1 > 2m. Each agent iEN makes a bid xi [0,00). The highest bidder wins the object and pays his/her bid. In case the set H of highest bidders has more than one agent, the agent with the lowest index in H c.e., Mint, wins the object. The losers pay nothing. (2) Formulate the above scenario as a strategic form game g = (NX, u). Nash (6) Show that, for each pe [2, 2], there is a equilibrium REX with R = p. (c) Find all Nash equilibria of g.