Let us have a grammarG:G $=(\{$X$,$ Y$,$ Z$),($a$,$ b$,$ c$),$ P$,$ X$)$P$=\{$X $->$ and Xb $|$ and X $|$Y$,$ Y $->$ Yb $|$ Z$,$ FROM $-$ epsilon $|$ b $\}$Select true $($v$)$ or false $($X$)$ for each statement: L$($G$)$ is a regular language. L $($ G$)$ is a recursively enumerable language.

L $($ G$)$ is a context$-$sensitive language.

L $($G$)$ is a context$-$free language.