Extra Credit: Problem 5 (10 points) We wish do add a yellow light to our traffic light example (discussed on page B- 68 in the textbook). We will do this by changing the clock to run at 0.25 Hz (a 4-second clock cycle time), which is the duration of a yellow light. To prevent the green and red lights from cycling too fast, we add a 30-second timer. The timer has a single input, called TimerReset, which restarts the timer, and a single output, called TimerSignal, which indicates the 30-second period has expired. Also we must redefine the traffic signals to include yellow. We do this by defining two output signals for each direction: green and red. In other words, we have NSgreen and NSred for north-south bound and EWgreen and EWred for the east-west bound. For each direction, when red is asserted, the red light wil be on; when red is off and the green is asserted, the green light is on; when red is off and green is off, the yellow light will be on. Draw the graphical representation for the finite-state machine for this improved traffic controller. Choose the names for the states that are different from the names of the outputs 1) 2) Write down the next-state and output-function tables for this traffic light controller. 3) Assign state numbers to the states and write a set of logic functions for each of the outputs (including the next-state outputs). Extra Credit: Problem 5 (10 points) We wish do add a yellow light to our traffic light example (discussed on page B- 68 in the textbook). We will do this by changing the clock to run at 0.25 Hz (a 4-second clock cycle time), which is the duration of a yellow light. To prevent the green and red lights from cycling too fast, we add a 30-second timer. The timer has a single input, called TimerReset, which restarts the timer, and a single output, called TimerSignal, which indicates the 30-second period has expired. Also we must redefine the traffic signals to include yellow. We do this by defining two output signals for each direction: green and red. In other words, we have NSgreen and NSred for north-south bound and EWgreen and EWred for the east-west bound. For each direction, when red is asserted, the red light wil be on; when red is off and the green is asserted, the green light is on; when red is off and green is off, the yellow light will be on. Draw the graphical representation for the finite-state machine for this improved traffic controller. Choose the names for the states that are different from the names of the outputs 1) 2) Write down the next-state and output-function tables for this traffic light controller. 3) Assign state numbers to the states and write a set of logic functions for each of the outputs (including the next-state outputs)