If L is a regular language, then (L’)’ U L will be :
(a) L
(b) L’
(c) f
(d) none of the mentioned
I had been asked this question during a job interview.
The above asked question is from Closure Properties under Boolean Operations topic in section Properties of Regular Languages of Automata Theory