I have attached a question with solution, I just want to know is my solution correct of making NFA to DFA because I know it's an NFA as there are multiple input from one states. If it's wrong can someone provide with the write state diagram. Is the transition for state $\{23\}$ correct because from $2$ if we take $0$ we go to $\{3,1\}$ and if we take $0$ from $3$ we go to $\{1\}$ so that makes it $\{1,3\}.$ Furthermore, what will be the right regular expression for it$.$ Most of the answers state it as $(0+1)*0$ but it can't be because through $1$ we go to dead state. If I am wrong can anyone correct me also with this?