Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*?
(a) €
(b) a*
(c) All of the mentioned
(d) None of the mentioned
I have been asked this question in quiz.
The doubt is from Minimization of DFA topic in section Finite Automata and Regular Expression of Compiler