Consider the grammar

$->|$

$->|$

Where $$ is the start symbol, $$ and $$ are the non$-$terminals and $$ and $$ are the terminals. For each of the following indicate if $(0)$ the input has no parse tree according to the grammar, $(1)$ the input has one unique parse tree according to the grammar or $(2)$ the input only two parse trees according to the grammar.

$1.$ a a b b $(2$ a$$s followed by $2$ b$$s$)$

$2.$ a a a b b b $(3$ a$$s followed by $3$ b$$s$)$

$3.$ a a a a b b b b $(4$ a$$s followed by $4$ b$$s$)$

$4.$ a a a a a b b b b b $(5$ a$$s followed by $5$ b$$s$)$

$5.$ a a a a a a a a b b b b b b b b $(8$ a$$s followed by $8$ b$$s$)$

$6.$ Give an example of an input that has three parse trees according to the grammar.

$7.$ Draw two of the parse trees for the input given in part $6$