In the following static game, suppose that (U,L) and (D,R) are both Nash equilibria. L R U a, b c, d D e, f g, h How many mixed-strategy equilibria (i.e., equilibria in which at least one player assigns strictly positive probabilities to both actions) can this game have? Please select ALL possible answers from below. Hint: it may help to draw a best-response diagram. 0 0 0 1 0 2 0 3 0 4 O more than 4, but finitely many O infinitely many