Consider the following finite automaton: b q a b b a r a b P a t b a) Find the sequence of configurations (computation) of the automaton on the string aaabba and determine if the string is accepted b) Find the sequence of configurations of the automaton on the string aabaab and determine if it accepts the string aabbaab. c) Describe (informally) the language accepted by the automaton. Activa Go to S