$2\mathrm{.}999$ Consider the grammar $G=(\{S,A\},\{a,b\},R,S)$ with the following set of

production rules $R$

$SaS|baA|abaA$

$A$aAbb$|aAb|$

Determine what is the language generated by $G.$

Show that the grammar $G$ is ambiguous by

$($a$)$ Providing two distinct leftmost derivations for the same string winL$(G).$

$($b$)$ Providing two distinct parse trees for the same string winL$(G).$