A state s in a finite-state machine is said to be reachable

Question

Question: A state s' in a finite-state machine is said to be reachable from state s if there is an input string x such that f (s, x) = s' . A state s is called transient if there is no nonempty input string x with f (s, x) = s. A state s is called a sink if ƒ (s, x) = s for all input strings x. Answer these questions about the finite-state machine with the state diagram illustrated here

a) Which states are reachable from s₀?

b) Which states are reachable from s₂?

c) Which states are transient?

d) Which state are sinks?