uestion $3-$DFA M

Consider the fol $^(\text{'})$

Part $1$ Select all words in L$($M$)$M $\backslash$epsi lon

$($b$)$ cac

$($c$)$ aa

$($d$)$ bc

$($e$)$ cccbb

$($f$)$ bbb

$($g$)$ cbccbc

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

language L$($M$)$ of the DFA M :

$($a$)$ c$^(*)$ac$^(*)$ac$^(*)\backslash$cup c$^(*)$bc$^(*)$bc$^(*)$

$($b$)$ c$^(*)$a$^(+)$c$^(*)$a$^(+)$c$^(*)\backslash$cup c$^(*)$b$^(+)$c$^(*)$b$^(+)$c$^(*)$

$($c$)\backslash$Sigma $^(*)($aca$\backslash$cup bcb$)\backslash$Sigma $^(*)$

Part $3$ Select all items that are correct statements:

$($a$)$ L$($M$)$ contains infinitely many words

$($b$)$ L$($M$)^($C$)$L$($M$)$ L$($M$)$ and L$($M$)^($C$)$ is not a regular language

$($d$)$ L$($M$)$ satisfies the pumping lemma with pumping length p$=6$

$($e$)$ L$($M$)$ is a regular language