Problem 5 [20 pts] Prove the following variant of the pumping lemma: Let L be a regular language. Then there exists n (depending on L) such that YuE L with lul 2 2n,a partition of w as w-xyzu where Ixyz 2n, y , z e, such that vk.j 0, zykZjUE L