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} L = {all strings the string contains equal number of O's and 1's} IV. OIV Categorize the languages as 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 = { w l w is any string and the (Length of w) mod 3 = 0} OL OIV