Use the Pumping Lemma for CFLs to show that the following languages are not Context-Free.

(a) {w {a, b, c} n_a(w) < n_b(w) and n_a(w) < n_c(w)}

(b) {aⁿ b^j c^kd^l n k and j l}