Consider the context-free grammar below ($\epsilon$ denotes the empty string, alphabet is $\{a,b\}$):
$$S\rightarrow \epsilon \mid aSb \mid bSa \mid SS.$$
What language does it generate?
- $(ab)^{\ast} + (ba)^{\ast}$
- $(abba) {\ast} + (baab)^{\ast}$
- $(aabb)^{\ast} + (bbaa)^{\ast}$
- Strings of the form $a^{n}b^{n}$ or $b^{n}a^{n},n$ any positive integer
- Strings with equal numbers of $a$ and $b$