Consider the following NFA N:

:+ nfa N

{

Q={q1,q2,q3,q4,q5}

S={a,b}

q0=q1

d(q1,a)={q2}

d(q2,\e)={q3}

d(q2,a)={q1}

d(q3,\e)={q1}

d(q3,b)={q4}

d(q4,b)={q5}

d(q5,b)={q3}

F={q3}

}

Question: Use !{the algorithm from the notes} to construct a DFA M that is !{@eqnt} to N_2.