A finite automaton accepts which type of language:

• A. Type 0
• B. Type 1
• C. Type 2
• D. Type 3