Construct a regular expression

a$.$ The total number of $$b$$ is divisible by $4$ no matter how they are distributed

and $$a$$ are only found in clumps that is divisible by $3.$

b$.$ All strings with even number of b$$s

c$.$ MOREA where all strings have more a$$s than b$$s

$\{$a$,$aa$,$aab,aba,baa,aaaa,aaab,....$\}$

d$.$ LESSA where all strings have less a$$s than b$$s

$\{$abb$,$aabbb,aabbb,babab,bbaba,babababbab,bbbbabaab,....$\}$

e$.$ Every word has even number of substrings $$ab$.$

f$.$ Every word has odd number of substrings $$ab$.$

g$.$ Language of strings not having bb or aa at any place

h$.$ Write the Regular expression for the language of all even length strings but

starts with a R$.$E $=($ab $+$ aa$)($aa$+$bb$+$ab$+$ba$)*$

i$.$ Consider the language L of strings defined over $\backslash$Sigma $=\{$a$,$ b$\},$ in which every a is

followed immediately by the string bb$.$

j$.$ All strings of a$$s and b$$s that contain an odd number of a$$s or an odd

number of b$$s R$.$E $=$ b$*$ab$*($ab$*$ab$*)*|$ a$*$ba$*($ba$*$ba$*)*$