Here is an epsilon$-$NFA:

Suppose we construct an equivalent DFA by the construction technique we have seen in class. That is$,$ start with the epsilon$-$closure of the start state A$.$ For each set of states S we construct $($which becomes one state of the DFA$),$ look at the transitions from this set of states on input symbol $0.$ See where those transitions lead, and take the union of the epsilon$-$closures of all the states reached on $0.$ This set of states becomes a state of the DFA. Do the same for the transitions out of S on input $1.$ When we have found all the sets of epsilon$-$NFA states that are constructed in this way, we have the DFA and its transitions.

Carry out this construction of a DFA, and identify the states of this DFA $($as a subset of the epsilon$-$NFA's states$)$ from the list below.

Select all that apply:

ABCDHIJKMN

BCDEGHIJKLMN

BCDFGHIJKMN

ABCD

BCDEGHIJK

BCDFGHIJK

BCDEGHIJKMN

LN

IJKMN

BCD

BCDGHIJKMN

ABCDEFGHIJKLMN