$(50$ pt$)$ Show that the following language is not regular using pumping lemma.

$L=\{a^{n-2}{b}^{n+2}|n2\}$

$(50$ pt$)$ Find the parse tree for the string $0011$ using the grammar:

$SAB$

$A00A|$

$B1B|$