Closure properties of CFLs. I mentioned in class that if L is a CFL and R is regular, then LnR is a CFL. What about Lin L2 when both are CFLs, and what about other properties you might expect? For each of the following, et L1 and L2 be arbitrary CFLs and determine whether the given language MUST be a CFL ("YES"), or you can find a counterezample "NO"), i.e., particular choices of CFLs L1 and L2 such that the language is not a CFL. For the YES's give a short justification involving the construction of a grammar/PDA from the given grammars/PDAs. For the NO's, use the CFL pumping lemma or known non-contert-free languages to establish your countererample. a) L L2 (concatenation) b) LinL2 (intersection) c) L1UL2 (union ) d) L1' (asterate)