Using Algorithm $2\mathrm{.}5$ translate the NFA$-\backslash$epsi into a DFA. Show all epsilon closures and all steps

as shown in the example in the textbook. $($You can use $1,2,...$ for state names as opposed to

q$1,$ q$2,....)$ Show the state diagram of the DFA and show the tabular of the DFA. Be sure to

indicate the start state and final state$($s$)$ and be sure to label all states and transitions.