Please draw it in a paper

1. Design a DFA a. Accepting all strings over {0,1,2,3} such that the sum of the symbols in the string is equivalent to 2 modulo 4 or 3 modulo 4 b. Accepting the set of all strings of 0s and 1 's that contains 010 or 100 a. Accepting the set of all strings that has an even number of 0 s and an odd number of 1s