Part $1$ Select all words in L$($N$)($that is$,$ all words that are accepted by the NFA N$)$:

$($a$)$ bc $($b$)$ ba

$($c$)$ acb $($d$)$

$($e$)$ acccbb $($f$)$ bccca

$($g$)$ cbccbc

$7$ points Part $2$ Among the three given options, select the regular expression that defines the

language L$($N$)$ of the NFA N:

$($a$)$ bc$+$a $$ ac$+$b $($b$)$ ac$$b $$ bc$$a$$

$($c$)$ a$$b $$ b$$a$$