$(5$ points$)$ We defined a regular grammar to only have rules of the form $VV|V|.$ For example $AbC|aA|D||.$

Prove that if a CFG only has rules of the form $V{}^{**}V|V|,$ then it decides a regular language. Rules of this form look like $A$bcdeF$|abaB|B||.$