Can you help me with these questions, please?

(a) Given the graph A D F B E (i) Determine whether the graph has an Euler trail. Construct the Euler trail if exists or explain why if it doesn't have one. [2.5 marks] A D F B E (ii) Use the breadth first search algorithm to find a spanning tree in the above graph. Assume vertex E is the root and the selection of next vertex follows the alphabetical order if more than one choices. Show clearly each step of how the algorithm is performed. Then draw the spanning tree. [4.5 marks] (b) b $ b a, b b S2 Consider the finite-state automaton given above, with s, and sz be the initial and accepting states, respectively. (i) Show the state transition when the inputs are given as follows in sequence, starting from initial state. Then determine whether the inputs are accepted by automaton. abbaba aababa [2 marks] (ii) What is the language accepted by the automaton? [1 mark]