In the context of binary numbers, a parity check is the process of iteratively running through the bits in a binary number to determine if there are an even or odd number of ones. Design a state machine that takes a binary number of arbitrary length as the input and gives an output Z that represents the parity of that number. The outpu is Z 0 when the number has an even number of ones and Z 1 when there are an odd number of ones. Include a state transition diagram and a circuit implementation with D flip-flops In the context of binary numbers, a parity check is the process of iteratively running through the bits in a binary number to determine if there are an even or odd number of ones. Design a state machine that takes a binary number of arbitrary length as the input and gives an output Z that represents the parity of that number. The outpu is Z 0 when the number has an even number of ones and Z 1 when there are an odd number of ones. Include a state transition diagram and a circuit implementation with D flip-flops