Use the pumping lemma to show that the following languages are not context free: a)0^n0^2n0^3n;n>=0 b) {w#x \ where w.x e {a,b) * and w is a substring of x} c) (a^ib^ja^ib^j|i,j>0)

answer should be very clear .otherwise I will down vote .