Chapter 11.2, Problem 2ED

(A) Using Theorem $4$, give conditions on $a,b,c$, and $d$ to guarantee that the Non strictly determined matrix game is fair.

$M=\left[\begin{array}{cc}a& b\\ c& d\end{array}\right]$

(B) Construct the matrix of payoffs for a two-finger Morra game that is Non strictly determined and fair.

(C) How many such matrices are there? Explain.