Give one example of a language, either by using the standard name of the language, or describing it in very few words. No proofs are required.

(a) Give an example of an infinite language that is regular.

(b) Give an example of a context-free language that is not regular.

(c) Give an example of a language in the class P that is not context-free

(d) Give an example of a recursive language that is not NP

(e) Give an example of a recursively enumerable language that is not recursive.

(f) Give an example of a language that is not recursively enumerable.