please answer both answers and draw it and explain your answers b$)$ Trace all computations of the string aaabb in $M.$

$($Hint: you need to draw the computation tree for string aaabb for problem b$),$ as you

learned in video "chapter$5$ NFA Lecture".$)$

$(10$pts$)$ Use the construction given in the video "chapter$5$ More NFA Lecture" to convert the

following NFA to equivalent DFA.