===============Implement the above problem using T FF ( I need this one)===========================

A sequential circuit has an input (X) and outputs (Y and Z). YZ represents a 2-bit binary number equal to the number of 1's that have been received as inputs. The circuit resets when the total number of 1's received is 3, or when the total number of 0's received is 3. Find a Moore state graph and table for the circuit. A sequential circuit has an input (X) and outputs (Y and Z). YZ represents a 2-bit binary number equal to the number of 1's that have been received as inputs. The circuit resets when the total number of 1's received is 3, or when the total number of 0's received is 3. Find a Moore state graph and table for the circuit