Given a DFA M that recognizes a language L, give a general method you could use to construct an NFA that recognizes L^R. the reverse of language L. If L contains a string w, L^R contains the string w^R. To give two examples, if L = {ab,baa}. L^R = {ba.aab}: if L is the set of 'strings that start with a', L^R is the set of 'strings that end in a', Your solution should not be a specific example but should explain how to construct this NFA in general for any M