Consider the grammar G$,$ with the start variable S$,$ the set of terminal symbols $=\{$a$,$b$,$c$\},$ and the set of productions P that contains the following rules:

$$ S$$ABC$$

$$ A$$aAa$|$

$$ B$$bbbB$|$b

$$ C$$ccCcc$|$cc

Which one of the following statements is TRUE?

Question $4$Answer

G is a regular grammar and L$($G$)$ is regular.

G is a regular grammar but L$($G$)$ is not regular.

G is not a$$ regular grammar but L$($G$)$ is regular.

G is not a regular grammar and L$($G$)$ is not regular