1. Let -(a, d) and cf . Define For each Ci,i 1,2,3, either construct a CFG G with L Ci is not context-free L(G), or prove that 2. Consider the language LwEa,b a CFG for it, or prove that it is not a CFL Is context-free? Either construct (a) Is Li a CFL? If so construct a CFG for it. If not, use the pumping lemma for CFLs to show that it is not a CFL (b) Is L2 a CFL? If so construct a CFG for it. If not, use the pumping lemma for CFLs to show that it is not a CFL