2. Show that the problem of determining whether a given DFA accepts a palindrome string is decidable. Hint: consider the DFA that recognizes the reverse language. Recall also that regular languages are closed under intersection. Your proof should be an informal description of an algorithm or Turing Machine that starts from the encoding of the original DFA