Exercise: Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L^{r}. Justify the correctness of your construction. (That is, verify that the language that is recognized by the automaton your construction produces is actually the reversal of the language the given automaton recognizes.) What is the effect of your construction on the Myhill graph of the automaton?