Suppose Sam wants to send bit streams to Kelly. To make the communication in secret, Sam decides to encode him bit streams using a sequential parity checker (where the output of the parity checker values to 1 if and only if the accumulated number of l's seen so far in the input bit stream is odd). For example, the bit stream 00101101 will be encoded as 00110110 (a) (4 pts) Please help Kelly derive the state graph and output equation of a Mealy decoding circuit that coverts the encoded bit stream from Sam back to its original bit stream. [Make the graph state minimized] (b) (4 pts) Repeat (a) for a Moore circuit implementation