helpppp

Let a machine M = ({so, s1, 52, 53, s.), {m, a, c), so, S. fs), s) be the Deterministic Finite Automaton (DFA) with state transition defined as follows (Table 2): Table 2 Next state Input TI A State So SI So S S SI 52 S) S2 S Sj 54 SJ Sy SI 54 S] 5J Si d) 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. 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) 111 You must show the sequence of state transition in cach