7. [5 Points] Pumping Lemma. Prove the following variant of the Pumping Lemma: For each context-free language L there exists a pumping length p0 such that each word w with wL and wp can be written as w=uvxyz such that i. vxyp ii. v= iii. uvnxynzL for all n0.