Consider the following CF G G:

S $->$ SS $|$ T

T $->$ aT b $|$ ab

$$ What is the language G generates $[2$ marks$]$

$$ Show that G is ambiguous $[4$ marks$]$

$$ Give an unambiguous grammar H where L$($G$)=$ L$($H$)[4$ marks$]$

$$ Sketch a proof that H is unambiguous.