Automata question (Chomsky Hierarchy)

Categorize the languages as Type O or Recursively Enumerable Languages Type 1 or CSL III. Type 2 or CFL Type 3 or Regular in accordance to the Chomsky hierarchy (select only one of the answers designating the lowest level) over the alphabet {0,1} L = {1202n In is a positive integer} 0000 Categorize the languages as = Type O or Recursively Enumerable Languages Type 1 or CSL Type 2 or CFL Type 3 or Regular in accordance to the Chomsky hierarchy (select only one of the answers designating the lowest level) over the alphabet {0,1} = = L = {1"o2n In is a positive integer} = =