Consider the deterministic finite automaton M = (K,,,s,F), where K = {90,91,92,93,94}, = {a,b}, S = 90 F = {90,92,93} and 8 is given by the following table. q 90 90 91 91 92 92 93 93 94 94 0 a b a b a b a b a b 8(9,0) 91 94 94 92 93 90 91 92 94 94 (1) Draw the state diagram for the deterministic finite automaton. (2) Derive the configurations to show whether the string abbaba is accepted or rejected by the deterministic finite automaton. AG