When using the pumping lemma with length to prove that the language L = {a'baa", n > 0) is nonregular, the following approach is taken Assume Lis regular. Then there exists an FA with k states which accepts L. We choose a word w = a baak = xyz, which is a word in L Some options for choosing xyz exist 1.x=y=aP, z = ak Pbaak, for some p > 0, p 0, p 0, p+q