Which is true for the following game according to the solution concept of iterated elimination of strongly dominated strategies? A B C a 1,4 -2,-2 4,0 b 6,2 -2,3 3,-6 c 5,-1 -1,0 5,2 d 0,0 0,3 5,4 The unique strategy profile that solves the game is (d,C). Player 2 is guaranteed a payoff of 4. Player 1 is guaranteed a payoff of 6. The strategy profiles (c,C) and (d,C) solve the game. None of the other alternatives is true. The unique strategy profile that solves the game is (b,A)