7. A language class is a set of languages. This course will cover several language classes (regular, context free, etc), and as a warm-up to this concept, consider the class of finite languages. Assume that 2 is a finite, nonempty alphabet. Let FINITE be the class of all finite languages over 2, and let coFINITE = {LI Lc is FINITE), That is the set-complement of L is a finite language. Use an alphabet of (0,1) or fa,b or fa,b.c) a. Give an example of a finite language. Given an example of a co-finite language. b. Are there any languages that are both finite and co-finite? If yes, give an example. If no, explain why not. c. Are there any languages NOT in the set FINITE U co-FINITE? If yes, give an example. If no, explain