Given the following traffic light sequence:
a) Give the minimum number of flip flops for such sequence. Be aware that the binary numbers where all the inputs are equal (e.g., 0 and 3) are not being used. You may treat impossible states as don't cares (Justify your answer):
b) Write the truth table for this sequence:
c) Use Quine McCluskey to find the smallest sequential logic circuit needed this sequence:
d) Draw the circuit found in part c
