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 = {onamok lk, m, n are any positive integers} - = = IV Categorize the languages as I. Type 0 or Recursively Enumerable Languages II. 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} Tund L = {0nm okn>m>k and k, m, n are any positive integers} IV