Conversion of regular expression to e-NFA takes ___________ time.
(a) linear
(b) exponential
(c) logarithmic
(d) none of the mentioned
I got this question in my homework.
This intriguing question originated from Conversions among Representations topic in division Properties of Regular Languages of Automata Theory