Question $2(3$pts$)$

Consider the following formal language:

$\backslash$Sigma $=\{$a$,$b$,$c$\}$

$$ L$=\{$acbbb$,$aacbbbbbb,aaacbbbbbbbbb,...$\}$

$($a$)$ Write a description for this language.

$($b$)$ Tell me whether you think it$$s a regular or a context free language, and why. You must support your answer with specific examples or evidence.

$($c$)$ Provide a grammar for the language $($either regular or context free, depending on your answer$).$