For each of the following state tables, show a state diagram and complete the timing trace as far as possible (even after the input is so no longer known).

a.

x 10110001

q ₁ 0

q ₂ 0

z

b.

x 11010101001011

q A

z

c.

d.

00 q1q2|x=0|x=1|x=0|x=1 01 10 91 92 11 01 00 N 00 00 0 10 11 0 1 01 01 1 1 0 1 0 |x=0| X=1 q* BC A|A B 0 CA N B 0 D 0 D C B 1 9 BC q* X=0|X=1| X=0| X=1 AB C 0 1 CA N A 0 N B 1 x 001110000010 9 A 0 0 9 A|A B BC x=0|x=1|x=0|X=1 q* D C Z x q A 1 CA B 0 0 N D D 0 0 0 01000111101 1 0