Problem 2 (DFAs) Let alphabet S= {0,1). For the following two languages, find a DFA that accepts it. Try to make it as simple as possible. Also, for each DFA, show its computation (as a sequence of transitions) for the input string 01, and for the input string 11001. (a) All strings where the number of 0's is divisible by 2 and the number of 1's is divisible by 3. (b) All strings where the third character from the beginning is 0. (c) All strings with no more than two l's Hint: To "debug" your DFA, look for strings it accepts but should not, or strings it does not accept but should