This might be a stupid question but please bear with me. I'm trying to solve this game but I'm in doubt on how to represent the strategy profile of the game. The game looks like this in extensive-form. I've marked the path with red that show the best actions of the players when it is their turn to move. The game is a game of perfect information.
The normal-form of the game looks like this:
From the normal-form we can see that there are 4 Nash equilibria of the game. Using backward induction I've come to the conclusion that $(df,\neg rr)$ is the unique subgame-perfect Nash equilibrium. My concern arises when we take a look at player 2. His pure strategy set would be $S_{2} = \{rr, r\neg r, \neg rr, \neg r \neg r\}$. In my normal-form representation of the game I've written the pure strategies of player 1 as $S_{1} = \{df, d\neg f, \neg df, \neg d \neg f\}$. For some reason I'm more tempted to write player 1's pure strategy set as $S_{1} = \{dff, df\neg f, d\neg ff, d\neg f \neg f,\neg dff, \neg df \neg f, \neg d \neg ff, \neg d \neg f \neg f\}$ and we would have a 8x4 matrix-representation of the game. Thus, the unique subgame-perfect Nash equilibrium would be $(df\neg f, \neg rr)$. Can somebody shed some light and help me with my doubts? Thanks in advanced.