$1.($a$)(15$ points$)$ Give a context free grammar for the following language:

L $=($w $|$ w contains at least one a and at least one b$),<==($a$,$ b$).$

$($b$)(5$ points$)$ Give the parse tree of the string aabbab using the CG in part