(6 pts.) Suppose M is an NFA accepting L-. Explain how to modify M to obtain an NFA accepting rev(L) r E L, where a denotes the reverse of string a Tip: The modified machine should be able to read strings reversed compared to the original machine. What change will achieve that? One needs to be careful about the initial state (there should be only one) and the set of accepting states. Drawing a general picture of the old and the new NFA can help visualizing the changes. Note: You should explain precisely what you need to modify from M to get the new NFA (enough to define the parts of M that do change), and then show that it will accept exactly those strings that are reverses of strings accepted by M (i.e., show that if the new NFA accepts a string, it must be the reverse of a string accepted by M, and in M accepts a string, its reverse will be accepted by the new NFA)