2. (10 points) Consider the DFA, M, whose state diagram is given by: q0 q2 (a) If z E L(M), w the string obtained by fipping bits in z (changing 0 to 1 and 1 to 0) also be in L(M)? why or why not? (b) True or false: for any string , if z is in L(M) then so is R. Prove your answer. (c) Write a regular expression that describes L(M) Hint: Think back to a mathematical description of L(M) from Individual HW1. How does this descrip tion interact with the state diagram, and can you make use of this to design your regular erpression? Also, consider checking your work using JFLAP