Remove any dominated strategies, and then find the optimum strategy for each player and the value of the game. 437956 A. After removing any dominated strategios, the payof matrix reduces to M=[4796] (Type an integer or decimal for each matrix element.) B. The original payoff matrix cannot be reduced. Find the optimum strategy for player A. Choose the correct answer below and fill in the answer box(es) to complete your choice. A. The game is not strictly determined. Player A should choose row 1 with probability fow 2 with probability and row 3 with probability (Type integers or simplified fractions.) B. The game is strictly determined. Player A should choose row (Type a whole numbet.) Find the optimum strategy for player B. Choose the correct answer below and fill in the answer box(es) to complete your choice. A. The game is not strictly determined. Player B should choose column 1 with probability and column 2 with probability (Type integers or simplified fractions.) B. The game is strictly determined. Player B should choose column (Type a whole number.) The value of the game is (Type an integer or a simplified fraction.)