It is not a matter of defining an automaton recognising the language. Regular languages are closed under the reverse operation: if L is regular, then LR is regular.
The general idea of the proof is that, given the automaton that recognises L, you can transform it into an automaton that recognises LR by reversing the transitions.