1. For the following DFA, (a) Write the formal definition of M = (0.2.8.40.F), where can be defined with a table contains three columns: current state, input, and next state. (b) What is the language accepted by M? (c) Please find a string x such that both x and x (x is the reverse of x) are in L(M)? (d) Please find a string y such that neither y nor y are in L(M)? b start 40 91 b 42 a,b 2. For the following DFA, (a) Write the formal definition of M = (0,2,8.40.F), where can be defined with a table. (b) What is the language accepted by M? Give an informal description in English and briefly explain. (c) Are there strings x E L(M) (not including the empty string) such that if the bits of x are flipped (changing to land 1 to 0), the resulting string will also be in L(M)? Explain why. (d) Is this true for every string x E L(M)? 0 start 40 91 92 0 0 1 43 44 95 0 0 0