Explain the two ways, with either player I or player II moving first, of representing an \(m \times n\) bimatrix game as an extensive game that has the given game as its strategic form. Giving an example may be helpful. In both cases, how many decision nodes do the players have? What is the number of terminal nodes of the game tree? Why do we need information sets here?