I was wondering if someone can help explain this question. I've been stuck on it for a while and having a hard time with it.
Use the pumping lemma to show that following language is not context-free L={a^k b^m c^n ∣ k>m>n≥0}
Thanks in advance for any help.