Write a grammar for the language consisting of strings that have n copies of the word abc followed by one more number of copies of the letter b, where n > 0. For example, the strings abcabcabcbbbb are in the language but a, ab, ba, and aaabb are not.