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

$L=\{win{}^{**}|w$ starts with $an$ a and contains the substring abb$\}$

Give a regular expression $R$ where $L(R)=L.$