Design a finite state machine that keeps track of whether the number of 1's that have been received on its input 'i' is an odd number. The output 'o' is initialized as 0, but should be 1 after receiving an odd number of 1's from the input.

Hey i really need some solving this problem: 1. encrypt this binary string into cipher text: 110000. include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x n mod (m) = y & 2. decrypt this cipher text into a binary string: 106 you.