help with deterministic finite automata

Exercise 2.2 Consider the following finite automaton: a) Find the sequences of configurations (computations) of the automaton on the strings aababa and bbaababaaa and determine if the strings are accepted. b) Find the sequences of configurations of the automaton on the strings aabaab and bbaababb and determine if they are accepted. c) Describe (informally) the language accepted by the automaton