Solutions of the exercises on Grammars and Regular Expressions

Give a context-free grammar (CFG) for each of the following languages over the alphabet ? = {a, b}:. (a) All strings in the language L : {anbma2n|n, m ? 0}.