Generalize the previous argument: Show that for any regular language, its verlan is regular. To do this, consider any DFA M$=($Q$,\backslash$Sigma $,\backslash$delta $,$q$0,$F$),$ and build NFAs for each of the cases. You can assume that the union of NFA languages is regular.