10 points) Figure 4 10 describes the relationship between regular, context-free decidable, and Twing- recognizable languages, in particular, that one is the proper subset of the next. For this problem, I want you to verify the fact that they are proper subsets. (Note, you do not need to provide proofs for this problem.) 1 (a) Provide an example of a language that is regular. Answer: (b) Provide an example of a language that is conteat-free but not regular. Answer: (c) Provide an example of a language that is decidable but not context-free. Answer (d) Provide an example of a language that is Turing-recognizable but not decidable. Answer: (e) Provide an example of a language that is not Turing-recognizable