Consider the following context-free grammars and languages. In each grammar, S is the start symbol, capital letters are, lower case letters are terminals, and e is the empty string. Match up the grammars with the languages they generate. Include the letter of the language after each grammar. A given language may be used for more than one grammar. Each grammar should match one language. Grammars: S rightarrow aSb, S rightarrow e. ____ S rightarrow aSa, S rightarrow b. ____ S rightarrow SaS, S rightarrow b. ____ S rightarrow aSa, S rightarrow bSb, S rightarrow e. ____ S rightarrow aSb, S rightarrow bSa, S rightarrow SS, S rightarrow e. ____ S rightarrow aSbS, S rightarrow bSaS, S rightarrow S, rightarrow e. ____ S rightarrow aSb, S rightarrow bSa, S rightarrow aSa, S rightarrow bSb, S rightarrow e. ___