Consider the context-free grammer $G$ below. There $S$ is the starting non terminal symbol, while $a$ and $b$ are terminal symbols.
$S \rightarrow aaSb | T$
$T \rightarrow Tb | a$
Which of the following statments is true about the language $L(G)$ generated by $G$?
- $aabbaabb$ belongs to $L(G)$ but $aabb$ does not
- $aaaaabbb$ belongs to $L(G)$ but $aaaabb$ does not
- $aaaabb$ belongs to $L(G)$ but $aabbaabb$ does not
- $aaabb$ belongs to $L(G)$ but $aaaaabbb$ does not
