Consider 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 aaaabbbb are in the language but a, abb, ba and aabbb are not. Give a BNF grammar for the language