A column strategy is given. Use P= 0-1 5 9 -9 4 0 3 0 0-5 and find the optimal pure strategy (or strategies) the other player should use. Express the answer as a row matrix. HINT (See Example 2.] (Select all that apply.) C = 1 1 1 3 3 3 [1000] [0 1 0 0] (0010] 0001) Determine the resulting expected value of the game.