Select each choice that is a true statement about the algorithm for converting epsioln$-$NFA$$s to

NFA$$s$.$ There may be more than one correct choice.

$($a$)$ The set of states is not changed.

$($b$)$ Any accepting state in the epsilon$-$NFA is also an accepting state in the NFA.

$($c$)$ For a state q and a symbol a$,$ it is possible that $|$N $($q$,$ a$)|>|$E$($q$,$ a$)|.$

$($d$)$ For a state q and a symbol a$,$ it is possible that $|$N $($q$,$ a$)|<|$E$($q$,$ a$)|.$