3. [20pt Use the pumping lemma to prove that the following languages are not regular In all cases, = {0, 1): (c) L,-{ no(w) 2m (w)) where n(w) is the number of occurrences of z in w (d) L4 nijgki,i,k0 and t