Let M = ({90, 91, 92, 93, 94, 95}, {a,b, n}, qo, fs, 92, 93, 94}) be the Deterministic Finite Automaton (DFA) with state transition function, f, defined as follows: f(qo, a) = 91 f(qo, b) = 90 f(qo, n) = 92 f(91, a) = 92 f(91, b) = 91 f(qi, n) = 91 f(q2, a) = 93 f (92, b) = 92 f(q2, n) = 24 f(q3, a) = 91 f(q3, b) = 93 f(q3, n) = 24 f(q4, a) = 93 f(q4, b) = 95 f (94, n) = 95 f(q5, a) = 24 f(qs, b) = 93 f (95, n) = 95 a) b) c) d) Draw the transition diagram for the above machine. (5 marks) Show the sequence of state transition for the input strings banana. (2 marks) Is the input string banana accepted by the DFA? Justify your answer. (2 marks) Find ONE input strings that follow the given conditions and must accepted by machine M. (6 marks) i. Length of strings is 4 and do not contains input n. ii. Length of strings is 5 and do not contains input b. iii. Length of strings is 3, start and end with the same input string (for example: aba). You must show the sequence of state transition in each