Feedback for subjective question

Question 1: Let L be any language. Let us define the transpose of L to be the language of exactly those words that are the words in L spelled backward. If w L then reverse (w) L. for example, if L = {a, abb, bbaab, bbbaa}Then Transpose (L) = {a, bba, baabb, aabbb, Prove that if there is an FA that accepts L, then there is a TG that accepts the transpose of L.