For the Given Row Strategy R, Find the Optimal Pure $P = \left[ \begin{array} { c c c } 0 & - 1 & 5 \\2 & - 2 & 4 \\0 & 3 & 0 \\1 & 0 & - 5\end{array} \right]$

Multiple Choice

For the given row strategy R, find the optimal pure strategy (or strategies) the other player should use. Express the answer as a row or column matrix. $P = \left[ \begin{array} { c c c } 0 & - 1 & 5 \\2 & - 2 & 4 \\0 & 3 & 0 \\1 & 0 & - 5\end{array} \right]$ , $R = \left[ \frac { 4 } { 5 } , \frac { 1 } { 5 } , 0,0 \right]$

A) The strategy is $[ 0,1,0 ] ^ { T }$ ; the resulting expected value of the game is -1.2
B) The strategy is $[ 1,0,0 ] ^ { T }$ ; the resulting expected value of the game is -1.2
C) The strategy is $[ 0,1,0 ] ^ { T }$ ; the resulting expected value of the game is -0.7
D) The strategy is $[ 0,0,1 ] ^ { T }$ ; the resulting expected value of the game is -1.2
E) The strategy is $[ 0,1,0 ] ^ { T }$ ; the resulting expected value of the game is -0.2