1. (3pts) Write a grammar for the language consisting of strings that have n copies of the letter followed by the same number of copies of the letter b where n >0. For example strings ab, aaaabbbb, are in the language but a abb, ba, aaabb are not. Zumb3pts) Draw a parse tree for aaabbb using your grammar