$(5$ points$)$ We defined a regular grammar to only have rules of the form V $->\backslash$Sigma V $|$ V $|\backslash$epsi $.$

For example A $->$ bC $|$ aA $|$ D $|\backslash$epsi $.$

Prove that if a CFG only has rules of the form V $->\backslash$Sigma $$V $|$ V $|\backslash$epsi $,$ then it decides a

regular language. Rules of this form look like A $->$ bcdeF $|$ abaB $|$ B $|\backslash$epsi