urgent!

Problem 2. (48 points) For the following languages, state whether the language is: 1) regular, 2) context-free but not regular, or 3) not even context-free. Prove each of your statements either by drawing a DFA/NFA/PDA, developing a gram- mar, or using pumping lemma for regular/context-free languages. You may also use the closure of regular and context-free languages under set operations. . The language of all strings over the alphabet {a,b} that contain a substring aa but do not contain aaa. . The language of all strings over the alphabet (0,1}' where the number of Is is divisible by 3. . The language of all strings over the alphabet {0,1,2}* such that there are exactly twice as many O's than l's, and exactly three times as many l's as 2's. Digits can come in any order (empty string is in the language). The language of all strings over the alphabet {a,b,c}', where a's come before b's and b's come before c's, and there is an equal number of a's and b's and c's