Draw the transition diagram for a DFA accepting the following languages over the alphabet {0, 1}. a) L = {w | the fourth symbol from the end of w is a 1}

b) L = {w | the number of 0's in w is divisible by 3 and the number of 1's is divisible by 2}