I'm literally so confused on how to even start this problem of proving that the given language is not Context Free.L = {a^i b^j c^k d^l | i = k and j = l}I know that we have to find cases where it contradicts the three conditions of the pumping lemma in all cases, but I'm not good in doing so.Thanks for the help!
Pumping Lemma for CFG - How to do it?
formal languages;context free