I have seen that generically any finite games have odd number of equilibria. So for $2\times 2$ games can we say that generically they must have $3$ equilibria? If not can you give an example of games which have $5$ or $7$ equilibria? Many thanks!
It depends on what you mean by generically. The Prisoner's Dilemma has exactly one equilibrium. If you generate the payoffs in your $2 \times 2$ game by drawing payoffs from continuous i.i.d.'s then there is a non-zero probability (seems to me that the exact number is 25%) that you will get a game similar to the Prisoner's Dilemma, i.e. a game with strictly dominant strategies for both players.
There is also a 'smaller' class of games with even number of equilibria, you can read about them here:
The Oddness Theorem (Wilson 1971) states that nearly all finite games have an odd number of Nash equilibria. In this post, we’ll explain what the theorem means in practical terms.
You can also have a game with an infinite number of equilibria. (E.g. a $2 \times 2$ game with all zeros.)
However if the number of equilibria is finite you cannot have more than three in a $2 \times 2$ game.