$2.10$ points Your parse tree should have a variable X in a subtree rooted

at X$.$ Using that variable repetition, break the string abbabccbab into

substrings u$,$ v$,$ x$,$ y$,$ z according to the Pumping Lemma for contextfree grammars.

$3.6$ points What are $2$ other strings in L$($G$)$ using the uv$^($i$)$xy$^($i$)$z rule?

$4.19$ points Prove the following language is not context$-$free.

L $=\{$wxw $|$ w in $\{$a$,$ b$\}^,$ x in c$^*,$ and $|$w$|=2|$x$|\}$

Please answer as many as you can