4. Consider the following state-transition diagram given in Figure 3, with one input x, and one outputF. (a) Determine the state-transition table (b) Assign bits to to each state and

determine the truth table (c) Determine Boolean Algebra expressions for each state bit, and output (d) Design circuitry to perform the operation of the state-transition diagram