please answer the question and also draw the State diagram on a piece of paper Let $N$ be the NFA whose state diagram is given below.

$(1)$ Draw the computation tree of $N$ on the string aabaab.

$(2)$ Is aabaab in $L(N)?($yes$/$or$)$