If L is DFA-regular, L’ is
(a) Non regular
(b) DFA-regular
(c) Non-finite
(d) None of the mentioned
I had been asked this question during an interview for a job.
Question is from Properties-Non Regular Languages topic in section Regular Expressions and Languages of Automata Theory