Complete the following:

a) Construct a DFA that recognizes the following over the alphabet {a,b}: L = { w | w has an even number of a's each of which is immediately followed by a b}

b) Write a regular expression that generates the language over {0,1}* that contains every string except 11 and 111. You may use in your expression.

c) Consider the strings over the decimal digits that represent an unsigned base-10 integer that is processed beginning with the most significant digit. Draw a DFA that accepts this string if the integer is evenly divisible by 5.

E = (AU B)