Automata question (Chomsky Hierarchy)

Categorize the languages as Type 0 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} IV. L = {01m ok ln>m and k, m, n are any positive integers} ol II Categorize the languages as Type O or Recursively Enumerable Languages 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 = {all strings the string contains even number of both O's and 1's} ol OIV