Show that the following languages are not regular by using the pumping lemma. 1. {ayman+m|n, m >0}, 2. {z|x = xR, x *}, where xR means x reversed; these strings are called palindromes. An example is abba, a non-example is baba. Show that the following languages are not regular by using the pumping lemma. 1. {ayman+m|n, m >0}, 2. {z|x = xR, x *}, where xR means x reversed; these strings are called palindromes. An example is abba, a non-example is baba