Consider merging red and yellow state into a single stop state. Transitions into or out of

those states are now directed to or from the new stop state other transitions stay the

same. The new stop state is the initial state. Is the resulting FSM deterministic? Why? If

it is deterministic, give a prefix of the trace of length 4. Otherwise, draw the computation

tree up to depth of 4.

input: tick: pure output: go, stop: pure tick/go green red tick /stop tick /stop yellow