Consider this formal language:

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

$$ L $=\{$aac$,$ abc, acc, aaacc, aabcc, aaccc, aaaaccc, aaabccc, aaacccc, $...\}$

$($a$)$ In your own words, write a description of this language.

$($b$)$ Tell me whether you think it$$s a regular or a context free language. Support

your answer with specific properties of this language or with some kind of evidence that will clearly show which kind of language this is$.$

$($c$)$ Provide a rule$-$based formal grammar for this language, either regular or context free depending on your answer in part $($b$).$