1. Consider the following finite automaton: DFA1=(Q,,,q0,F) where 1. Q={q0,q1} 2. ={0,1} 3. =\begin{tabular}{l|l|l|} & 0 & 1 \\ \hlineq0 & q1 & q0 \\ q1 & q1 & q1 \end{tabular} 4. F={q1} (a) (5 points) Draw the diagram for this finite automaton. (b) (5 points) We defined a configuration as a pair [q,s] where q is the current state and s is the part of the input string remaining to read. A computation is a sequence of configurations. Provide the computation of this DFA on input string 1101 and indicate if the string is accepted. (c) (5 points) Provide the computation of this DFA on input string 111 and indicate if the string is accepted. (d) (5 points) What is the language accepted by this automaton