(All-pay auction with many bidders) Consider the generalization of the game considered in the previous example in which there are n ≥ 2 bidders.
Find a mixed strategy Nash equilibrium in which each player uses the same mixed strategy. (If you know how, find each player's mean bid in the equilibrium.)