$14$ points Using the method discussed in the videos and text, derive a

regular expression for the language of the DFA shown below. Remove

the states in the order q$1,$ q$2,$ q$3.$ Show each step of the process.

fig $2$

:$+$ dfa

title WS $7$ Problem $3$

Q$=\{$q$1,$q$2,$q$3\}$

S$=\{0,1\}$

d$($q$1,0)=$q$2$

d$($q$1,1)=$q$3$

d$($q$2,0)=$q$3$

d$($q$2,1)=$q$3$

d$($q$3,0)=$q$1$

d$($q$3,1)=$q$2$

q$0=$q$1$

F$=\{$q$2\}$

done.