Question$1$: Consider the context$-$free grammars with the given strings and find the following:

a$)$ Give a leftmost derivation for the string.

b$)$ Give a rightmost derivation for the string.

c$)$ Give a parse tree for the string.

d$)$ Describe the language generated by this grammar.

S$->$aTb

$TaT|bT|$

with string abaaab