What is meant by regular languages closed under union in Theory of Automata and Formal Languages?

A. union always makes a language undecidable B. regular languages cannot be combined C. the union of two regular languages is also regular D. union always creates a context-sensitive language