*! Exercise 2.2.10: Consider the DFA with the following transition table: Informally describe the language accepted by this DFA, and prove by induction on the length of an input string that your description is correct. Hint: When setting up the inductive hypothesis, it is wise to make a statement about what inputs get you to each state, not just what inputs get you to the accepting state. ! Exercise 2.2.11: Repeat Exercise 2.2.10 for the following transition table