Homework 12 FSM to detect binary sequence You want to detect a sequence of binary numbers any time they occur, even embedded in other binary numbers. The input is x and the sequence you are looking for is 1011. An output of Y=1 should be generated when you detect this sequence. Otherwise Y should be 0. 1) Draw a state diagram. Choose A,B,C,D,E for state names. 2) Make a state assignment table. 3) Using this create a state table using the state assignments in (8) 4) Using the data from the state table create a truth table for Q2*, Qi*, Qo*, and Y. 5) Using Karnaugh maps or Boolean Algebra find Q2*, Qi*, and Qo*, and Y. 6) Implement this Q2*=D2, Q1*=D1, and Qo*=Do, using D flipflops and digital logic. Also use digital logic to create output Y