6. (Extra Credit 10 pts) Write a grammar that describes the following language: the set of strings that consist of a sequence of a's followed bya sequence of b's, where the number of a's is odd, and equal to the number of b's, over alphabet fa, b. In other words, the language fanbn In 0 and n is odd)