2. (10 points) Consider the DFA, M, whose state diagram is given by: start 9o 91 42 0 0 93 45 0 (a) What is the language recognized by M? Give an informal description in English and briefly justify your answer. b) Are there strings z E L(M), such that if the bits of z are flipped (changing 0 to 1 and 1 to 0), the E L(M)? resulting string will also be in L(M)? Why or why not? Is this true for every string (c) Write the formal definition of M = (Q, , , go, F). Use a table to define . Created by Paint X