Design a DFA that recognizes the following language:

a.) L = {w {a, b}* | all strings that has an even number of a s and each a is followed by at least one b }

b.) L = {w {0, 1}* | all binary strings that end with 01}

c.) L = w {a, b}* | w starts with an a and has at most one b}