5. which statement regarding a finite state machine (fsm) is not true: (a) in a non-deterministic fsm, a string is invalid if there is one path not leading to a final state (b) in a simple deterministic fsm, a string is invalid if there is no rule and you are not in a final state (c) in a simple deterministic fsm, not all possible transformations are specified (d) in a simple deterministic fsm, if you are in a final state and there is no rule, the string is valid (e) in a non-deterministic fsm, a string is valid if there is any path which leads to a final state