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

A. only finite languages have complements B. complement requires a PDA C. the complement of every regular language is non-regular D. the complement of a regular language is regular