What is meant by language {a^n b^n | n >= 0} in Theory of Automata and Formal Languages?

A. a regular expression with no operators B. a finite language only C. a language accepted by every DFA with one state D. a standard example of a non-regular language