The behaviour of NFA can be simulated using DFA.
(a) always
(b) never
(c) sometimes
(d) none of the mentioned
The question was asked in my homework.
The doubt is from Conversion by Eliminating states in portion Regular Expressions and Languages of Automata Theory