A palindrome is a string that reads the same when read in reverse. Thus tattarrattat^2 is a palindrome. Also, let us consider the empty string e to be a palindrome. Consider the alphabet sigma = {0, 1} and let us denote the language Pal_sigma = {w/w sigma* and w is a palindrome}. Prove without using pumping lemma that Pal_sigma is not a regular language. Prove using pumping lemma that Pal_sigma is not a regular language