Construct regular grammars that produce the following languages:

$1.1=$ all strings in $\{,\}$ with an odd number of $$a$$s

$2.2=\{$ in $\{0,1\}=,$where $||=2$ and $$ in $\{0,1\}\}$ Construct regular expressions that produce the following languages:

$3.3=$ all strings in $\{,\}$ that have exactly one $$b$$ and an even number of $$a$$s

$4.4=$ all strings in $\{0,1\}$ that contain the substring $000$ but not the substring $0000.$