Top 3, 6 4, 0 2, 2 Middle 10, 3 -1, -1 9, 3 Bottom 6, 1 -6, 1 5,1 0 Use the iterated elimination of strictly dominated strategies S) on the game above and show all steps, games, and parisons that you have created. Is the game dominance solvable? What is the Nash equilibrium