A regular language (also called a rational language) is a formal language that can be expressed using a regular expression.
Assume that $L=L_1.L_2$ is a regular language. Also assume that $L_1$ is regular. Is it true that $L_2$ is regular too ?
Note: Please prove it using a DFA. I know how to do that with regular expressions. Thank you in advance.