3. (20 pt.) Prove that the following language is not context-free using the pumping lemma. E = {a¹b/ck | i≤j, i ≤ k, and i, j, k ≥ 0}