Is this a correct answer? why or why not? do not copy an answer from other chegg

4. (25 points) Please use the pumping lemma to prove that the following language is not regular. Recall that string r is a palindrome ifr-R. L is a palindrome over alphabet -{a, b} 4 Question 4 Choosing a string for ababa, and the arbitary number is 5, ababal 5, so choosing x-a.yeb,z-aba, |y| > 0, xy-ab, lab!