Convert the following nondeterministic finite automaton: 0 1 0 B 0 1 to a DFA, including the dead state, if necessary. Which of the following sets of NFA states is not a state of the DFA that is accessible from the start state of the DFA? O a) (A,C) O b) (A,B) O c) {B,C} d) {B}