Design Non $-$ Deterministic Finite Automata $($NFA$)$ and Deterministic Finite Automata$($DFA$)$ to recognize the following sets of strings:

$1.$ abc, abd, aacd. Assume the alphabet $=\{$a$,$ b$,$ c$,$ d$\}$

$2.0101,101,011.$

$3.$ ab$,$ bc$,$ ca$.$ Assume the alphabet $=\{$a$,$ b$,$ c$\}$