DFA for the language L $=($w starts with an a and contains the substring abb$)[4$ marks$]$ Consider the following NFA $N=(Q_N,,{}_N,q_N,F_N)$ :

Following the construction presented in class, give the state diagram and formal $5-$tuple definition

for equivalent DFA $D=(Q_D,,{}_D,q_D,F_D)$ with $L(N)=L(D).$