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

OBJECTIVE FUNCTION VALUE $=3\mathrm{.}500$

VARIABLE

VALUE

REDUCED COSTS

PA$1$

$0\mathrm{.}050$

$0\mathrm{.}000$

PA$2$

$0\mathrm{.}600$

$0\mathrm{.}000$

PA$3$

$0\mathrm{.}350$

$0\mathrm{.}000$

GAINA

$3\mathrm{.}500$

$0\mathrm{.}000$

CONSTRAINT

SLACK$/$SURPLUS

DUAL PRICES

$1$

$0\mathrm{.}000$

$0\mathrm{.}500$

$2$

$0\mathrm{.}000$

$0\mathrm{.}500$

$3$

$0\mathrm{.}000$

$0\mathrm{.}000$

$4$

$0\mathrm{.}000$

$3\mathrm{.}500$

a$.$

What is Player A$\text{'}$s optimal mixed strategy?

b$.$

What is Player B$\text{'}$s optimal mixed strategy?

c$.$

What is Player A$\text{'}$s expected gain?

d$.$

What is Player B$\text{'}$s expected loss?