For every DFA, there is an ε-NFA that accepts the same language.
(a) True
(b) False
The question was asked by my school principal while I was bunking the class.
The doubt is from The NFA with epsilon-moves to the DFA-2 topic in section Finite Automata and Regular Expression of Compiler