Which of the following properties correctly describe a Regular Grammar ?

(A) All productions rules are of the form $A \rightarrow xB$ or $A \rightarrow x$, where $A$ and $B$ are non terminal symbols and $x$ is a terminal symbol.

(B) Regular grammars are more powerful than context-free grammars and can express any type of language.

(C) There is a direct correspondence between regular grammar and finite automata.

(D) Regular grammars can generate languages that are not recognised by any type of automata.

Choose the correct answer from the options given below :