1. Look at the Venn diagram that shows the relationships (assuming P not equal NP and NP not equal PSPACE) between the language classes from question 1 from the questions from 1/25. For each area in your Venn diagram, give a simple example of a language over {0,1} that lives there. (You may assume that Sipser's encodings are binary strings.) So, 1. Give a simple example of a finite language. 2. Give a simple example of language that is regular, but not finite. 3. Give a simple example of language that is a CFL, but not regular. 4. Give a simple example of language that is in P, but not a CFL. 5. Give a simple example of language that is NP-complete. 6. Give a simple example of a language that is in NP, probably not NP-complete, and probably not in P. 7. Give a simple example of a language that is in PSPACE but not in NP (assuming NP not equal PSPACE). 8. Give a simple example of language that is decidable, but not in PSPACE. 9. Give a simple example of language that is RE, but not decidable. 10. Give a simple example of language that is not RE. 1. Look at the Venn diagram that shows the relationships (assuming P not equal NP and NP not equal PSPACE) between the language classes from question 1 from the questions from 1/25. For each area in your Venn diagram, give a simple example of a language over {0,1} that lives there. (You may assume that Sipser's encodings are binary strings.) So, 1. Give a simple example of a finite language. 2. Give a simple example of language that is regular, but not finite. 3. Give a simple example of language that is a CFL, but not regular. 4. Give a simple example of language that is in P, but not a CFL. 5. Give a simple example of language that is NP-complete. 6. Give a simple example of a language that is in NP, probably not NP-complete, and probably not in P. 7. Give a simple example of a language that is in PSPACE but not in NP (assuming NP not equal PSPACE). 8. Give a simple example of language that is decidable, but not in PSPACE. 9. Give a simple example of language that is RE, but not decidable. 10. Give a simple example of language that is not RE