urgent? need

2. (30 pt) Sort the following classes of languages from the smallest to the largest. 1. Recursively Enumerable Language 2. Regular Language 3. Language recognized by Deterministic Finite Automaton 4. Language recognized by Deterministic Turing Machine 5. Language recognized by Nondeterministic Turing Machine 6. Context Free Language 7. Language recognized by regular expression 8. Language described by context free grammar 9. Recursive Language 10. Language recognized by Pushdown Automaton Provide example(s) if the smaller class of languages is a proper subset of the larger class. For example, if you claim language class A is a proper subset of class B, provide one language that is in the class B but not class A