Design a sequence detector as a moore machine that can detect the pattern 101 using D-flip flops.

(a) Build the state graph for the machine.

(b) Find the number of FFs required.

(c) Build the state and the transition table of the machine and extend it to include the inputs of the FFs.

(d) Find the minimum SOP expression for each input of each flip-flop.

(e) Build the logic circuit of the sequence detector.