3. Consider the deterministic finite-state machine in the figure below that models a simple traffic light. input: tick: pure output: go, stop : pure (a) Formally write down the description of this FSM as a 5-tuple: (States, Inputs, Outputs, update, initialState) . (b) Give an execution trace of this FSM of length 4 assuming the input tick is present on each reaction. (c) Now consider merging the red and yellow states into a single stop state. Transitions that pointed into or out of those states are now directed into or out of the new stop state. Other transitions and the inputs and outputs stay the same. The new stop state is the new initial state. Is the resulting state machine deterministic? Why or why not? If it is deterministic, give a prefix of the trace of length 4. If it is non-deterministic, draw the computation tree up to depth 4