The LP formulation for player II's problem in a game with payoff matrix T given above, is: Min v subject to: 4y1 + y2 + 3y3 <= v 2y1 + 3y2 + 4y3 <= v y1 + y2 + y3 = 1 yj³0, j = 1, 2, 3, and v is unrestricted note: <= means greater or equal to The answer is given as :The optimal solution for player II is=> y1 = 1/2, y2 = 1/2, y3 = 0. For the above problem, I dont understand how to find the optimal solutions(y's. How did they find the y's using above LP formulation? i tried to solve it using the linear algebra..getting echlon form extra..but couldnt get the answer..please help