Assume that A = {a"b™c*]n, m, k E Z>o, n = 2k} are two CF languages. 2m} and B = {a"bmck|n, m, k E Z>0, m = (а) ( not closed under intersection (Hint: show that ANB is not a CFL using pumping lemma...

o, n = 2k} are two CF languages. 2m} and B = {a"bmck|n, m, k E Z>0, m = (а) ( not closed under intersection (Hint: show that ANB is not a CFL using pumping lemma for context-free languages). Use A and B to prove that the family of context-free languages are (b) languages are not closed under complement. Use the proven claim in part a to show that the family of context-free 2. Prove that {a"bm² cn° dm \n, m E Z>o} is not context-free. "/>
Extracted text: Assume that A = {a"b™c*]n, m, k E Z>o, n = 2k} are two CF languages. 2m} and B = {a"bmck|n, m, k E Z>0, m = (а) ( not closed under intersection (Hint: show that ANB is not a CFL using pumping lemma for context-free languages). Use A and B to prove that the family of context-free languages are (b) languages are not closed under complement. Use the proven claim in part a to show that the family of context-free 2. Prove that {a"bm² cn° dm \n, m E Z>o} is not context-free.