It is less complex to prove the closure properties over regular languages using:
(a) NFA
(b) DFA
(c) PDA
(d) Can’t be said
This question was posed to me in an interview for job.
This is a very interesting question from Applications of NFA in division Finite Automata of Automata Theory