Let L be a regular language over the alphabet {0, 1}. Use the Pumping Lemma to show that En 21 such that for all w E L where wn, there is another string z such that E Land ||