8. (a) Let A={0pp is prime }. Show that the language A is not regular. (b) Let B={1kyy{0,1} and y contains at most k 1s, for k1}. Show that B is not regular. (c) Prove that any finite language is regular. Does this tell you that the regular languages are closed under countably infinite intersections