Problem #1: sequence detector - receives and detects a bit serial sequence from single-bit input x and asserts an output z (i. e. z=1) when it detects a pattern binary string of 0110. one bit at a time is presented to your logic. use symbolic states with letters 'a', 'b' etc for you states. assume state 'a' is where it all starts out from reset. your state machine must continue to recognize the pattern as the stream of bits continue, in other words if the pattern of bits was 000011011000110 it should find 3 matching patterns of 0110.