7. Consider two languages: Li={ a"b"cmam | n>0,m>0} and L2={ a"b"c"am | n>0,m>0}. Show that one of them is context-free (by providing a context-free grammar that defies this language) and another is not context-free (by using closure properties of context-free and regular languages). Do not use pumping lemma