In this FSM how many inputs are there?

When in the Locked state what happens when the input is Push

When Unlocked if the input is Push

In this FSM which is the Accept State

Which is the Start State

When in State S2 if the input is 1

When the state is S2 if the input is 0

In this FSM the Accepted Input is

Starting at state S1 what state would input 'acd' change to

An input of 'ab' would result in state

At state S4 if the input is 'dbda' the machine is in state

In this FSM the Accept state is

Howm many inputs are there in this FSM

From the starting state is input 'abc' valid

What state will the machine rest in with an input of 'aabacda'

Final Question, what is the minimum accepted input of this Finite State Machine