grammar G over alphabet $\backslash$Sigma $=\{$a$,$ b$\}$ with start variable S:

S $->$ TaU

T $->$ VTa $|$ a

V $->$ a $|$ b

U $->$ aU $|$ b

$1.$ Provide a clear and concise description of the language of strings that can be derived from U and from T

$2.$ State five strings that are in L$($G$),$ and five that are not. The strings should be over $\backslash$Sigma $.$

$3.$ Show that G is ambiguous by providing two distinct leftmost derivations of the same string.

$4.$ Provide a grammar in Chomsky Normal Form that is equivalent to G$.$

$5.$ Provide a CYK table for the string abbaa and the following grammar:

S $->$ TU

T $->$ VT $|$ a

U $->$ a $|$ b

V $->$ UU