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$*$is $$the alphabet of $$the DFA$\{$win$*|$w$=$apbpcp $$for some $\{$:pinN$\}$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$=*\{$win$*||$w$|$is $$even