If L1′ and L2′ are regular languages, then L1.L2 will be
(a) regular
(b) non regular
(c) may be regular
(d) none of the mentioned
The question was asked during an interview.
I would like to ask this question from Closure Properties under Boolean Operations topic in portion Properties of Regular Languages of Automata Theory