3. Consider the following state-transition diagram of a circuit with 2 inputs (x and y) and 1 output (F). (a) Reduce the number of states in the state transition diagram (b) Assign bits to each state (e) Determine Boolean Algebra expressions for each state bit and output (d) Design circuitry to perform the operation of the updated state-transition diagram

Fig: 1

Fig: 2

Fig: 3

Fig: 4

Fig: 5

Fig: 6