Automata question

Categorize the languages as

I. Type 0 or Recursively Enumerable Languages

II. Type 1 or CSL

III. Type 2 or CFL

IV. Type 3 or Regular

in accordance to the Chomsky hierarchy (select only one of the answers designating the lowest level - Note that Type 3 is the lowest level and Type 0 is the highest level) over the alphabet {0,1}

L = {0ⁿ10^k |k, n is any integer}

i think its type 0.. am i right ? can you explain it

--------------------------------------

Categorize the languages as

I. Type 0 or Recursively Enumerable Languages

II. Type 1 or CSL

III. Type 2 or CFL

IV. 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 = {0ⁿ1ⁿ0ⁿ |n is a positive integer}

and this one i think its type 1