Please solve each part step$-$by$-$step and provide detailed explaination. Thank you for the help!

Given the following NFA with $-$transitions $($empty string moves$),$ where $1$ is the initial state

and $2,4,6$ are the final states.

$($a$)$ Draw the NFA

$($b$)$ Use ${}^{*}$ calculation to prove that the string babaa will be accepted by this machine.

$($c$)$ Give a computation tree for string aab. Is aab inL$(M)?$