Let 2 = {a,b}. Let A = {w | w = w R, where w E 2* and w R denotes the reverse of w}. Use the pumping lemma for regular languages to give a proof...

Please help for this question. It asks for using the pumping lemma to prove that this machine is not right. I know that we are supposed to find a loop in this machine to prove it is not finite, but I don't know how.