$2.13$ points Derive a regular expression from the DFA shown below by

creating a GNFA and removing states as discussed in class. Show

the initial GNFA and the GNFA resulting from each removed state.

Remove states in increasing order $($q$1$ then q$2).$

fig $1$

:$+$ dfa

title WS $7$ Problem $2$

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

S$=\{0,1\}$

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

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

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

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

q$0=$q$1$

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

done.