7.$7.$ Show the conversion between ($($ handwritten drawing)$)$

a)$)$ Regular Expression to Nondeterministic finite state automata NFA then to deterministic finite state automata ($($DFA).$).$ use R =($=($a +$+$ b)*.$)*.$a.($.($a|$|$b)*$)*$bb In addition, o put all the E closure and move calculations.

b)$)$ Regular expression to deterministic finite state automata ($($DFA)$)$ by solving an example.

c)$)$ Generate and test and input strings for your example using both ($($a)$)$ and ($($c).$).$