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 $1$s$.$

$4.$ Set of all strings that do not end with $11.$

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

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

$7.$ For $\backslash$Sigma $=\{$a$,$ b$,$ c$\},$ all strings with aab as a substring.

$8.$ For $\backslash$Sigma $=\{$a$,$ b$\},$ all strings with aababb as a substring.