Theory of Computation Please Solve:

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

Set of all non-empty strings.

Set of all strings that do not contain the substring 1010.

Set of all strings that are at least of length 4 and contain even number of 1s.

Set of all strings that do not end with 11.

Set of all strings with at most one consecutive pair of 1s.

Set of all strings that have an odd number of 1s and any number of 0s.

For = {a, b, c}, all strings with aab as a substring.

For = {a, b}, all strings with aababb as a substring.