Regular Grammars for Language L

Diagrams representing the regular grammars for the language L={a^m b^n c^p d^q | m,n,p,q≥0}.