QUESTION 16 Suppose that we have a state change diagram for a finite state automaton which contains an edge (s, s) with label ?. This means: OIn order to enter state s3 the FSA must receive an input symbol in the complement of Once the FSA is in state s3, it will remain in s3 regardless of the input. OThe FSA cannot enter the state s3 regardless of the input This is an invalid state change diagram, since directed graphs do not allow loops