NFA to DFA conversion is done via
(a) Subset Construction method
(b) Warshalls Algorithm
(c) Ardens theorem
(d) None of the mentioned
The question was posed to me by my college professor while I was bunking the class.
The doubt is from Conversions among Representations in section Properties of Regular Languages of Automata Theory