Please solve this question, thank you!

3. NFA to DFA Consider the NFA N=({q0,q1,q2,q3,q4,q5},{a,b},N,q0,{q4}) where N consists of the following nine transitions N(q0,)={q1}N(q1,a)={q5}N(q3,)={q4}N(q0,a)={q0}N(q1,b)={q2}N(q4,a)={q3}N(q0,b)={q0,q2}N(q2,a)={q3}N(q5,b)={q4}. Draw the NFA N and give a DFA M that accepts the same language as N