Question $5$Miscelaneous Consider the alphabet $=\{$a$,$ b$,$ c$\}.$ Select all items that are correct statements: $($a$)$ If all states of some DFA are accept states, then the language of the DFA is $($where $$ is the alphabet of the DFA$).($b$)$ The intersection of two regular languages is a regular language. $($c$)$ If a language contains infinitely many words, then the language is not regular. $($d$)$ The language $\{$w in $|$ w $=$ a p b p c p for some p in N$\}$ is a regular language. $($e$)$ If a language is regular then its complement is also a regualar language. $($f$)$ is an infinite set. $($g$)$ If a language satisfies the pumping lemma, then it is a regular language. $($h$)$ L $=\{$a$,$ b$,$ c$,$ aa$,$ bb$,$ cc$\}$ is a regular language. $($i$)$ L $=\backslash \{$w in $||$w$|$ is even$\}$ is a regular language $($j$)$ L $=\{$a$,$ b$,$ c$,$ aa$,$ bb$,$ cc$\}$ satisfies the pumping lemma with p $=5.$