finite math help

Determine the optimal strategy for C for the game with the following payoff matrix. 2 6 12 10 Write the associated linear programming problem for the matrix. Maximize Zy + zy, subject to the following constraints. z, 20. 2, 20 2z1 + 14 Zy + 12z, $1 10z, + Z,51 Sketch the feasible set for the problem. Choose the correct graph below. YA. O B. OC. OD. 422 422 422 422 27 + 147, =1 6z, + 127, $1 27, + 127, =1 63 + 12z, $1 20 + 147, =1 102 + 62, =1 22 + 142, =1 107, + 142, =1 21 (0,0) (D.0) (0.0) Identify the maximum value of zy + zz. The maximum value is (Type an integer or a simplified fraction.) The maximum value occurs at the vertex (21 20) = (Type an ordered pair, using integers or simplified fractions.)Calculate the value of v. V=- Zy + 22 (Type an integer or a simplified fraction.) Now calculate the value of G - GEV ZE (Type an integer or a simplified fraction.) Now calculate the value of c2- (Type an integer or a simplified fraction.) Therefore, the optimal strategy for C. in matrix form, is (Type an integer or simplified fraction for each matrix element.)