2. Design a DFA to watch for the binary pattern 01 in a serial data stream. For example, if the stream is 10100011110111100000101000.. prefix. The DFA reads an outputs 1 in every step if and only if the prefix seen up then the pattern 01 will be detected 5 times in the given input signal in each step, and to that point - including the given step itself - ends in 01. a) Draw the transition diagram of the DFA M described above, using only two states. Put the dingram in the box below b) Design M as a state machine, taking a single master-slave flip-flop for its state reg ister. Put the combinational logic 2 2 of the machine in the box of Fig. 3. Encode the initial state as 0 in order for the reset to work reset in Combinational logic Tow Figure 3: State machine detecting the pattern 01