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, aaabbb, and aaaaabbbbb are in the language, but a, abb, ba, and aaabb are not in the language.