Let the following problem ALLCFG: Given CFG G, is L(G) = Σ*? This problem is undecidable. (You do not have to prove this).
(a) Is this problem in RE (class of recursively enumerable languages), in core (class of all languages whose complement is in RE), in both, or in neither? Describe your answer.
(b) Use undecidability of ALLCFG to illustrate that following problem is also undecidable: Given PDA M1 and FA M2, is L(M1) = L(M2)?