A language is regular if and only if it is accepted by finite automata.

• A. The given statement statement is true
• B. Given statement is false
• C. Statement is partially true
• D. None of the mentioned