Question 2: An FSA recognizes words that begin with "un" and end with…

An FSA recognizes words that begin with "un" and end with "ed". The state transitions are defined as follows:

States:

• $q_0$ (Initial state)
• $q_1$ (After 'u')
• $q_2$ (After 'n')
• $q_3$ (After 'e')
• $q_4$ (After 'd', accepting state)

Transitions:

• From $q_0$ on 'u', go to $q_1$
• From $q_1$ on 'n', go to $q_2$
• From $q_2$ on any other character, stay in $q_2$
• From $q_2$ on 'e', go to $q_3$
• From $q_3$ on 'd', go to $q_4$ (Accepting state)

For which of the following inputs will the FSA reach the accepting state?