. Give a context-free grammar for the set (abc i-j or j-l-k) -ie., the set of strings of a's followed by b's followed by c's, such that there are either a different number of a's and b's or a different number of-b's and c's, or both. Determine whether the following language L is a context free language. If ti is, give a CFG that generates L. If it is not, use the pumping lemma for Context Free Languages to prove that it is not. 6. L-s in (a,b,c,d*Is contains twice as many a's as c's