Find the grammar that generates the following languages for = {, } a) All strings with exactly two as.

b) All strings with at least two as.

c) All strings with no more than one a.

d) All strings with at least one a. e) = { +2 0 }