Recall that a regular grammar is a CFG G $=($V$,\backslash$Sigma $,$ R$,$ S$)$ in which all rules are of the form

$($I$)$ B $->$ cA$,($II$)$ B $->$ A$,($III$)$ B $->$ c$,$ and $($IV$)$ B $->\backslash$epsi $,$ where A$,$ B in V and c in $\backslash$Sigma $.$ What

are the languages of regular grammars having

$($a$)$ rules of types $($I$),($II$),$ and $($III$),$ but none of type $($IV$)?$

$($b$)$ rules of types $($I$),($II$),$ and $($IV$),$ but none of type $($III$)?$

$($c$)$ rules of types $($I$),($III$),$ and $($IV$),$ but none of type $($II$)?$

$($d$)$ rules of types $($II$),($III$),$ and $($IV$),$ but none of type $($I$)?$

$($e$)$ rules of types $($I$)$ and $($II$),$ but none of type $($III$)$ or $($IV$)?$

$($f$)$ rules of types $($I$)$ and $($III$),$ but none of type $($II$)$ or $($IV$)?$

$($g$)$ rules of types $($I$)$ and $($IV$),$ but none of type $($II$)$ or $($III$)?$

Determine the answer for each, with a justification that you are correct.