Let = {0, 1}. Let wR denote the reverse of the string w. For example, if w = 01101, wR = 10110. Note that this reverse operator has higher precedence than the concatenation operator. Use the Pumping lemma to show that the language A = {wwR | w {0, 1}*} is not regular.