This question has ten blanks (ten things you need to answer). Consider the following automaton: (a) Write down the full, formal definition of the automaton on your paper. You may assume that the input alphabet is the set of symbols used in the diagram. Then enter only the letter of the correct choice for each component of the definition requested below. a. {1,2,3} b. {0,1,2,3} c. {1,2,3,4} d. {0,1,2,3,4} S= a. 0 b. 1 c. 2 d. 3 s0= b. {2} c. {0,1,3} d. {0,1,2,3} F= a. 0 b. 1 c. 2 d. 3 (1,b)= a. 1 b. 2 c. 3 d. 4 (2,b)= (b) Trace the execution of the automaton on the following input: cba List the sequence of states that the automaton goes through in the following fields, starting with the initial state. Enter only one state label in each field. Start: Next: Next: Next: (c) Does the automaton accept the input? Enter yes or no