Regular Languages conceptual

Question

Let L1 and L2 be languages over an alphabet Σ such that L1 ⊆ L2.
Which of the following is true:

	(A) If L2 is regular, then L1 must also be regular.
	(B) If L1 is regular, then L2 must also be regular.
	(C) Either both L1 and L2 are regular, or both are not regular.
	(D) None of the above.

Answer 1

Every possible language is subset of ∑^* and ∅ is subset of every possible language.

both ∑^* and ∅ are Regular languages so in that way if L1 ⊆ L2 then if L1 is regular then L2 can be regular or non regular and when if L2 is regular then L1 can be regular or non-regular.

so in that way D is correct answer.