D | Question 10 5 pts A diagram for a sequence recognizer is shown where the input is a and the output is M. When the sequence is recognized the output M will be high for one clock cycle. First determine and answer which input sequence this sequence recognizer detects? Second, given the state encoding, s0-000, s1-001, s2-010, s3-011, s4 100 where the most significant bit is p2 and the least significant is Po (e.g. for s4 p2 1.p1-0, po -on create a state table to find the input equations, n2M, rb for the P2-p1-po D Flip-Flops respectively and the output equation for M. Assume all unused state codes are don't care conditions Enter the sequence detected and the Boolean Algebra equations for no ni, no- and M s4 D | Question 10 5 pts A diagram for a sequence recognizer is shown where the input is a and the output is M. When the sequence is recognized the output M will be high for one clock cycle. First determine and answer which input sequence this sequence recognizer detects? Second, given the state encoding, s0-000, s1-001, s2-010, s3-011, s4 100 where the most significant bit is p2 and the least significant is Po (e.g. for s4 p2 1.p1-0, po -on create a state table to find the input equations, n2M, rb for the P2-p1-po D Flip-Flops respectively and the output equation for M. Assume all unused state codes are don't care conditions Enter the sequence detected and the Boolean Algebra equations for no ni, no- and M s4