You must match the letters (solutions) to the questions (1.1 , 1.2, 1.3, etc...)

Consider the following context-free grammars and languages. In each grammar, S is the start symbol, capital letters are nonterminals, 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 Sb, 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 aS, S rightarrow bS, S rightarrow Sa, S rightarrow Sb, S rightarrow e. S rightarrow aSb, S rightarrow bSa, S rightarrow SS, S rightarrow e. S rightarrow aSbS, S rightarrow bSaS, S rightarrow e. Languages {a, b}* Strings over {a, b) of even length. Strings over {a, b} with the same number of a's as b's. {a^nb^n: n greaterthanorequalto 0} (ba)*b {ww^R: w sum {a, b}*} {a^nba^n: n lessthanorequalto 0}