A student is revising language {a^n b^n | n >= 0}. Which explanation should be selected?

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