$1.)19$ points Prove the following language is not context$-$free.

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

$2.)5$ points Consider the following CFG$,$ G$.$

S $->$ aXb $|$ bY c $|$ SS $|\backslash$epsi

X $->$ aXb $|$ bY c $|\backslash$epsi

Y $->$ bY c $|$ aXb $|\backslash$epsi

Show the parse tree for deriving the string abbabccbab in G created in

grafstate.