Exercise $8($Ex$.41,$ Chapter $3$ of $[$Martin; $2011]).$ For each of the following regular expressions, draw an NFA accepting the corresponding language, so that there is a recognizable correspondence between the regular expression and the transition diagram.

$1.($a $+$ b$)($ab$)*($abb$)*$

$2.($a$*$bb$)*+$ bb$*$a$*$