Draw a parse tree.

Grammar S$->$ ab $|$ aSb

Specifially for these phrases:

$1.$ aabb

$2.$ aaaabbbb

The logic here is the quantity of $"$a$"$ is equal to the number of $"$b$"$

hence:

aabb

S$->$ aSb $->$ aabb

aaaabbbb

S$->$ aSb $->$ aaSbb$->$ aaaSbbb$->$aaaabbbb $($adding a & b for each iteration until it matches the phrase, removing the S symbol$).$

tl;dr

I need the drawings of the parse trees of

aabb

&

aaaabbbb

Using the grammar:

S$->$ ab $|$ aSb