Theory of computation

1. Draw a DFA for each of the following (here, = {0,1}):

1. Set of all non-empty strings.
2. Set of all strings that do not contain the substring 1010.
3. Set of all strings that are at least of length 4 and contain even number of 1s.