Problem 1 [20 pts] Consider the DFA defined by the following transition table, where qo is the start state, and accepting states are marked with an *. Describe the language it accepts. You do not need to prove your answer, but you should informally explain the took to arrive at your answer you 70 93 91 g19192 92192 939393