Consider the DFA,M, whose state diagram is given by:

q1 b 90 93 6 92 a) Describe the language L(M). b) If we L(M), will the string obtained by swapping a's and b's in w also be in L(M)? Explain your answer. c) If we L(M), will the string wR (the reverse of w) also be in L(M)? Explain your answer d) Describe in your own words the "role of each of the states. e) Write a regular expression that describes L(M). (please explain your reasoning.) f) * For c and d, if your answer is no, give a DFA that describes the language obtained by applying that operation (swapping a's and b's or reversing) to all elements of L(M) g) * Can you create a NFA for L(M) that uses fewer states