Shown below is the solution to the linear program for finding Player A's optimal mixed strategy in a two-person, zero-sum game.

OBJECTIVE FUNCTION VALUE=3.500

VARIABLE VALUE REDUCED COSTS

PA1 0.050 0.000

PA2 0.600 0.000

PA3 0.350 0.000

GAINA 3.500 0.000

CONSTRAINT SLACK/SURPLUS DUAL PRICES

1 0.000 0.500

2 0.000 0.500

3 0.000 0.000

4 0.000 3.500

a. What is Player A's optimal mixed strategy?

b. What is Player B's optimal mixed strategy?

c. What is Player A's expected gain?

d. What is Player B's expected loss?