Do set A or set B

SET A

Part $1(4$mks$)$: Given the regular expression: $)$ draw an equivalent

nondeterministic finite automaton $($NFA$).$

Part $2(5$mks$)$: Transform the NFA created in Part $1$ to an equivalent deterministic finite automaton $($DFA$).$

SET B

Part $1(4$mks$)$: Transform the nondeterministic finite automaton $($NFA$)$ below to an equivalent

deterministic finite automaton $($DFA$).$

Part $2(5$mks$)$: Demonstrate the steps involved in converting the DFA created in Part $1$ into an equivalent

Regular Expression.