Show that the class of recursive (or Turing-decidable) languages is closed under the operation of string reversal, i.e., show that if L is a recursive language, then is also a recursive language. Hint: Design a Turing machine which defines Rev(L) from a machine which defines L