Shown Below Is the Solution to the Linear Program for Finding

Shown below is the solution to the linear program for finding Player A's optimal mixed strategy in a two-person, zero-sum game. $\text { OBJECTIVE FUNCTION VALUE }=3.500$
$\begin{array}{ccc}\text { VARIABLE } & \text { VALUE } & \text { REDUCED COSTS } \\\text { PA1 } & 0.050 & 0.000 \\\text { PA2 } & 0.600 & 0.000 \\\text { PA3 } & 0350 & 0.000 \\\text { GAINA } & 3.500 & 0.000\end{array}$

$\begin{array}{ccc}\text { CONSTRAINT } & \text { SLACK/SURPLUS } & \text { DUAL PRICES } \\\hline 1 & 0.000 & -0.500 \\2 & 0.000 & -0.500 \\3 & 0.000 & 0.000 \\4 & 0.000 & 3.500\end{array}$
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?