For any string w = w_1w_2... w_n over an alphabet Sigma, the reverse of w, denoted w^R, is the string with symbols in the reverse order, w_n ... w_2w_1. Show that the class of regular languages over an alphabet Sigma is closed under the operation Reverse(L), defined as Reverse(L) = {w | w^R belongs to L}. To get you started: If L is a regular language, there is some DFA M such that L(M) = L. Describe in words how to define an NFA M' such that L(M') is the set of strings formed by reversing all strings in L. You do not need to include the formal definition of your NFA, but you should address all five components of the definition of an NFA in your description. That is, be sure to say what states you will include, your alphabet (which is arbitrary Sigma), how to transition between states, which state is your start state, and which state(s) are your accept states