You completed this exercise in the previous assignment to construct a NFA $($Use the

construction in Theorem $3\mathrm{.}1$ and find an NFA recognizing the languages $)$

$($i$)(01+001+010)*$

$($ii$)(0+1)*010$

$($iii$)0(10)*1$

Give an equivalent regular grammar for all the three above. Be clear in describing

the grammar as G$=($V$,$T$,$S$,$P$)$