Write down the grammar for language comprising of strings which have n copies of letter a followed by same number of copies of letter b, where n > 0. For instance, strings ab, aaaabbbb, and aaaaaaaabbbbbbbb are in language but a, abb, ba, and aaabb are not. (2) Also sketch parse trees for sentences aabb and aaaabbbb, as derived from grammar.