Give state diagrams of DFAs recognizing the following languages.

{w {0,1} |w begins with 010 and ends with a 0 }

{w {0,1} |w contains at most three 1s}

{w {a,b,c} |w does not contain the substring acab}

{w {a,b} | w starts with a and has even length, or w starts with b and has odd length }

{w {0,1} |w is the binary expansion of n Nand n 3 mod 5}. Assume represents 0 and that leading 0s are allowed. A number n N is congruent to 3 mod 5 (written n 3 mod 5) if n is 3 greater than a multiple of 5, i.e., n = 5k + 3 for some k N. For instance, 3, 8, and 13 are congruent to 3 mod 5.