List of top Theory of Computation Questions on Closure Properties of Language Classes asked in GATE CS

Let \(L_1\) and \(L_2\) be two languages over a finite alphabet, such that \(L_1 \cap L_2\) and \(L_2\) are regular languages.
Which of the following statements is/are always true?