In the 'Chomsky Hierarchy', which class of languages is recognized by a Finite State Automaton?

1. ক
   Type 0 (Unrestricted)
   
2. খ
   Type 1 (Context-sensitive)
   
3. গ
   Type 2 (Context-free)
   
4. ঘ
   Type 3 (Regular)