Design a finite state machine with one input X and a 2-bit output Z=Z₁Z₀. When the state machine starts, the output is Z=11 until it receives its first one input. When it receives the its first one input, the output changes to Z=00 to signal that the system is ready to receive a secret code. The output stays at Z=00 while it looks for one of two valid secret codes (111 and 010) after the initial first one. If it receives 111 then the output changes to Z=01 and stays at that value forever (i.e. it stops looking for a secret code). If it receives the other valid secret code (010) first, then the output changes to Z=10 and it stays at that value forever. A Moore machine will be easier for this assignment than a Mealy machine.

Assign binary codes to the state names A, B, C, etc. You need to determine how many flip flops are needed to accommodate your design. This state assignment state is arbitrary and a different assignment will result in different equations. That is fine but you need to document your design process very carefully

Please show all steps