(5 pts) Write down your FSA using mathematical notation, i.e., as a 5-tuple (Q, ?, s, F, ?):\ \ Q = {q0, q1, q2, q3, q4, q5, q6, q_accept}\ ? = {C, a, e, i, o, u}\ s = q0\ F = {q0, q1, q2, q3, q4, q5, q6, q_accept}\ \ (15 pts) Provide a Python script called smo_fsa.py that:\ (2 pts) Defines your FSA based on your answer to Question 2\ (2 pts) Defines good_sylls, a list of all strings that should be accepted by the FSA\ (2 pts) Defines bad_sylls, a list of all strings with phonotactically illicit diphthongs that should not be accepted by the FSA, e.g., iu, Ciu, eo, Ceo, etc.\ (5 pts) Defines a function recognizer_dfsa() that takes the arguments: (i) fsa: a list of 5 elements that contains the 5-tuple (Q, ?, s, F, ?), and (ii) input_string: the input string to be processed, e.g., Ca. The function should return a Boolean value indicating whether the input string is accepted or rejected by the fsa. Include a docstring!\ (4 pts) Demonstrates that your FSA accepts all the strings in good_sylls and rejects all the strings in bad_sylls