Using the pumping lemma for CFLs, show that the following languages are not context free:
L={w∈{a,b,c}∗ ∣ n_a (w) = n_b(w) < n_c(w)}