Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE?
(a) If L1 is regular then L2 will also be regular
(b) If L1 is regular and finite then L2 will be regular
(c) If L1 is regular and finite the L2 will also be regular and finite
(d) None of these