DFA for the language L $=($w starts with an a and contains the substring abb$)[4$ marks$]$ Consider the following DFA $M.$

Following the DFA to regular expression proof shown in class, provide a regular expression $R$ with

$L(R)=L(M).$ Show all the steps in your work by drawing the state diagram for the initial GNFA

as well as after each state removal. Remove states in lexicographic order $($i$.$e$.q_{\text{r}\text{i}\text{p}}=q_0,q_1,q_2).$