Problem 1. [16 points) Consider the DFA specified by the following transition table with start state p and set of accepting states {p.g}. State/symbol 0 a. Draw the state transition diagram of the automaton. Make sure to specify in your diagram the start state and the accepting states. b. Give the sequence of states corresponding to the computation of the automaton on the input string 01101001 c. List 3 input strings that are accepted by the automaton and 3 input strings that are not accepted. d. Describe the language accepted by the DFA. Justify your answer informally. You do not need to give a formal proof