3. Here is a nondeterministic finite automaton: 0 1 0,1 B D 1 0 Convert this NFA to a DFA, using the "lazy" version of the subset construction described in Section 2.3.5 (p. 60), so only the accessible states are constructed. Which of the following sets of NFA states becomes a state of the DFA constructed in this manner? O a) {A,B,D} O b) {B,C,D} O c) {A,C,D} O d) {B,C}