Consider the following two-player game. Player 1 (the row player) has three strategies {U,F,D}, and Player 2 (the column player) has four strategies {L,M,N,R}. In each cell, the first number is the pay-off of Player 1, and the second is that of Player 2. There is an unknown x in the table. Consider pure strategies only. (1) Find a number x such that {F,N} is the unique Nash equilibrium. (2) Find a number x such that the game has more than one Nash equilibria. What are these Nash equilibria in this case? (3) Is it possible to find a number x such that the game has no Nash equilibrium? For each of your answers above, an explanation needs to be provided