Do Not copy existing answers please!

Make sure to answer all parts to get like.

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 = { wl w= xbaby, wherex, ye^*}, { = { a, b} c) C={w I every odd position in wisa 2 }, {={0,1,2} d) L (Ma) = {v WTW contains exactly 2 a's and exactly 2 bs} e) L (Mb) = {v WTW is a binary string that is divisible by 3}