For any string w = w1W2w3 ... Wn, the reverse of w, written wR, is the string w in reverse order, Wn...wow1. For any language A, let AR = {wR|WE A}. Show that if A is regular, so is AR. Hint: Look at how closure of regular languages under regular operations is shown with nondeterminism in Theorems 1.45, 1.47 and 1.49 in the book. Also, think about how you worked on the complement operation in the previous assignment. Give both a verbal argument and the formal construction