Task 1: Pedestrian Stoplight traffic light green light by AJEL is Many crosswalks have a stoplight that tells pedestrians when they available under the Pixabay license can cross the street. They use three phases: 1. \"Go\" - solid green 2. \"Don't start\" - flashing red 3. \"Stop\" - solid red Your task is to design a finite state machine to simulate this type of stoplight. In total, your circuit will need: @ One input switch that represents the timer. When the timer signal is activated (X=1), the circuit moves to the next phase. @ Two output lamps, one for the green and one for the red light. @ Four memory states (and thus two flip-flops). The middle phase (flashing red) requires two states: one for the red light on and one for the red light off Go through all five steps of the finite state machine design algorithm: 1. State diagram Transition table (for J-K flip-flop) Next-state table Derive Boolean equations Implement circuit with LogicWorks chip schematics. we oh \"If using an OR chip, note the bug in LogicWorks where the OR chip behaves like NOR. To compensate, simply add an extra NOT gate on outputs of the chip. **Strobed D flip-flops at the outputs are not necessary. In this design, the two output lamps can be decoded directly from the state codes. A partially complete state diagram is provided for you in Figure 1. Here you can see the tricky part of the design: when in the \"flashing red\" phase, a timer signal of O cycles through the two states, but a timer signal of 1 moves on to the \"solid red\" phase. Figure 1: State diagram for Task 1, with a few missing words and numbers In report