Draw parse trees for the sentences aabb and aaaabbbb, as derived from the grammar of Problem 13.

Data From Problem 13:

Write a grammar for the language consisting of strings that have n copies of the letter a followed by the same number of copies of the letter b, where n > 0. For example, the strings ab, aaaabbbb, and aaaaaaaabbbbbbbb are in the language but a, abb, ba, and aaabb are not.