Let $=\{0,1\}.$ For each of the following languages design a DFA with minimal number of states that accept the language.i$)$ Draw a DFA that accepts the string $10$ or $010.$i$)$ Draw a DFA that accepts all strings but $001.$DRAW BY HAND