The reversal of a string w, denoted wR, can be defined recursively as follows: PR = . If w = ua for some string u E' and some letter a E, then wR = auk. Prove that for all w E", (WR)R = w. In your proof, you may use the following fact (which is proved in the course notes): VW E", VU E", (wu) R = u WR The reversal of a string w, denoted wR, can be defined recursively as follows: PR = . If w = ua for some string u E' and some letter a E, then wR = auk. Prove that for all w E", (WR)R = w. In your proof, you may use the following fact (which is proved in the course notes): VW E", VU E", (wu) R = u WR