Create DFA :

a)L={w| w is a word that begins with 1 or 2,finishes with 2 or 3 and the number of the other symbols is even} alphabet={1,2,3}. b)L={w| w is a word that represents an integer in a binary form and when is divided by 4 the remaining is 3 (number&4=3)} alphabet={0,1} c)L={w| w is a word where every a is followed either from an odd number of b or from an odd number of c} alphabet={a,b,c} d)L={w| w is a word that contains the string bbb at least three times}