finite math homework

For the following game. give the payoff matn'x and decide if the game is strictly determined. If so. determine the optimal strategies for R and (3. Two politicians. R and C. must decide to be for. against. or neutral on a certain bill. Polls show that if R is for the bill. then R will gain 2000 votes. lose 1000 votes. or gain 8000 votes. respectively. if C is for. against. or neutral on it. Similarly= if R is against the bill. then R will gain 1000 votes. gain 10.000 votes. or lose 2000 votes if C is for. against. or neutral on it; and if R is neutral. then he will gain 3000 votes. gain 5000 votes. or gain T000 votes if C is for. against. or neutral. Enter the values into the payomatrix below in thousands. {For example. enter T for a loss of T000 votes. and enter 12 for a gain of 12.000 votes.) C For Against Neutral For I R Against Neutral Is the game strictly determined? O A. No C) B. Yes What is the optimal strategy for R? O A. Play the rst row and come out for the bill. O B. There is no optimal strategy for R. O C. Play the second row and come out against the bill. C! D. Play the third row and come out neutral on the bill. What is the optimal strategy for C? O A. There is no optimal strategy for C. O B. Play the rst column and come out for the bill. O C. Play the second column and come out against the bill. O D. Play the third column and come out neutral on the bill