Context Free Grammar: (15 pts) Develop a CFG for the following language:

a) a²ⁿ bⁿ for n >= 1 : the exponent represents the number of repeated characters

b) Construct a leftmost derivation for a string in this language of length at least 4

c) Construct a parse tree for the same string as used in (b).