Using the construction described in the proof of Keene's theorem, find nondeterministic finite-state automata that recognize 01* U 00* 1 I need help with getting the result of the regular expression and the process of getting it.

Generate the finite automata that accepts the language generated by the following expression over the alphabet {x,y} by using the algorithm defined by Kleene's Theorem part 1. Extra null transitions between single characters may be eliminated for simplification.

Using the constructions described in the proof of Kleene’s theorem, find nondeterministic finite-state automata that recognize this set: (0 ∪ 11)* Please show each step to get the automaton. ALSO each step needs to have the finite state machine drawn by hand.