A grammar G=(V, T, P, S) is __________ if every production taken

a-grammar-g-v-t-p-s-is-if-every-production-taken

A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC
B->a

A. A. Ambiguous B. B. Regular C. C. Non Regular D. D. None of the mentioned

Right option is B. Regular

The following format of grammar is of Regular grammar and is a part of Context free grammar i.e. like a specific form whose finite automata can be generated.