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 VuE L with |w> 2n,a partition of w as w = xyzu where lxyzl 2n, yc, zc, such that yk, j > 0, xykZjVE L. 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 VuE L with |w> 2n,a partition of w as w = xyzu where lxyzl 2n, yc, zc, such that yk, j > 0, xykZjVE L