$1.$ What are the key differences between deterministic finite automata $($DFA$)$ and non$-$deterministic

finite automata $($NFA$)?$

$2.$ For the given alphabet $\{0,1\},$ design a simple finite automata which starts with $00$ and ends

with a $1.($e$.$g$.,001,0011,0001,00101,$ etc.$).$ Neatly describe the initial state, accepting

state, and transitions, if any.

$3.$ Given the regular expression a$+($bc$|$cb$)+$ad$?,$ design a DFA for it$.$