Consider the Following Two-Person Zero-Sum Game Is There an Optimal Pure Strategy for This Game? If

Consider the following two-person zero-sum game.Assume the two players have the same three strategy options.The payoff table shows the gains for Player A. $$\begin{array}{l}\begin{array} { | c | c c c c | } &&\text { Player B }\\\\{ \text { Plaver A} } & \text { Strategy } b _ { 1 } & \text { Strategy } b _ { 2 } & \text { Strategy } b _ { 3 } \\\hline \text { Strategy } a _ { 1 } & 6 & 5 & - 2 \\\text { Strategy } a _ { 2 } & 1 & 0 & 3 \\\text { Strategy } a _ { 3 } & 3 & 4 & - 3 \\\hline\end{array}\end{array}$$ Is there an optimal pure strategy for this game? If so,what is it? If not,can the mixed-strategy probabilities be found algebraically?