Let G$=($V$,\{$a$,$b$\},$S$,$P$)$be a regular grammar. Using G$,$ we define a new grammar G$=($V$,\{$a$,$b$\},$S$,$P$)$ as follows:$$

For every production X$$z in P$,$ where$$ z in $($V$\{$a$,$b$\}),$ the production set$$P$$ includes X$$bz$.$

Which of the following statements best describes G$$ and the language it generates?

Question $1$Select one:

G$$ must be a regular grammar but L$($G$)$ could be non$-$regular.

G$$ must be a linear grammar and L$($G$)$ must be regular.

G$$ must be a regular grammar and L$($G$)$ must be a regular language.

It is possible that G$$ is not a regular grammar and L$($G$)$ is non$-$regular.