I have the question attached below. For it$,$ I want the proper trasition table. Please look at the diagram carefully which states have which input symbol and as there are $3$ states so it would be $2^3$ subsets. Furthermore, I also want the correct regular expression for it$,$ where if we notice that if we make subsets so after taking input $1$ it will go to dead state from state $1$ which is starting state.