Exercise 2 Draw a state machine for a DFA that recognizes each of the following languages: a) A = {w w contain neither the substrings 01 nor 10}, { = {0,1} b) B = {w | w= xbaby, where x, y *}, { = {a,b} c) C = {w | every odd position in w is a 2}, {= = {0, 1, 2} d) L(Ma) = {vW | W contains exactly 2 as and exactly 2 bs} e) L(Mb) = {vW | W is a binary string that is divisible by 3}