PLEASE ANSWER BOTH!!!

Problem1 Find a grammar for the language L (a+b:n20) Prove that the language defined by your grammar is equivalent to L There might be many ways to describe L, but think about how to do it in a modular way. Problem 2 Find Granmars for -{a,b) that generates the following languages: all strings with exactly one a; .all strings with at least one a all strings with exactly two a's; strings with exactly two a' No proof is required in this