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.