If a DFA has n states and the language contains any string of length n or more, the language is termed as:

• A. Infinite
• B. Empty
• C. Non regular
• D. None of the mentioned