Let a machine M = ({so, SI, S2, S3, S4}, {m, a, e), so, fs, {S2, S4}) be the Deterministic Finite Automaton (DFA) with state transition defined as follows (Table 2): Table 2 Next state Input e ma State So SI So S2 S1 S1 S2 SI S2 S2 S3 S4 S3 S3 S1 S4 S4 S1 S3 SI a) b) c) d) Draw the state transition diagram for machine, M. (5 marks) Determine the final state for the input string mamee. You must show the sequence of state transition. (2 marks) Is the input string mamee 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 5 and do not contains input m. ii. Length of strings is 6 and do not contains input e. Length of strings is at least 2, start and end with the same input (for example: mam). iii. You must show the sequence of state transition in each