2. Consider the variation of hot-potato routing/coordination routing game discussed in class, where there are three strategies: Payoff Hot Potato Long Path Planned Long-Path | Planned Hot Potato -4,-4 -1,-5 -3,-3 -3,-3 -2,-2 -3,-3 -5,-1 -2,-2 -4,-4 Define the polyhedron that define the feasible region for the Nash equilibrium. Show how Lemke-Howson algorithm would find a Mixed Nash equilibrium