The pumping lemma with length for context-free languages (CFLs) can be stated as follows: Let L be a CFL generated by a CFG in CNF with p live productions. Then any word w in L with length >2P can be broken into five parts: w=uvxyzsuchthatlength(vxy)2plength(x)>0length(v)+length(v)>0 and such that all the words uvnxynz with n{2,3,4,} are also in the language L. Use the pumping lemma with length to prove that the language L={(a)n(b)2n+2(a)n11} over the alphabet ={a,b} is non-context-free