2. Consider the variation of hot-potato routing/ coordination routing game discussed in class, where there are three strategies: Payoff HotPotato Long_Path Planned HotPotato -4.-4 -1,-5 -3.-3 Long Path -3.-3 -2,-2 -3.-3 Planned -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