For a, just draw a state machine diagram. for b, just write the boolean expression. Should be derived from truth table.

2. Design a circuit using JK flip-flops that takes in a binary streamBoB1 B2Bs and outputs a 1 at time t if the B-1Bt), when read as an unsigned binary number from low bit to high, stream received thusfar (i.e., BoB is divisible by 3. The following table depicts a sample input stream and what should be output. 0 2 345 678 Int01 00 Val of inu0 12 12 12 76 76 76 val mod 30 00 0 01 output Hint: The value of the new bit starts as equal to 1 which is 1 mod 3, then is 2 which is 2 mod 3, then is 4 which (a) Draw the state machine, numbering your states in an "obvious" manner. You may assume that the machine (b) Give the algebraic formula (simplified as much as possible) for the J and K inputs of your lip-lops, and is back to 1 mod 3, etc. starts in the right state at time t- 0. also for the output. 2. Design a circuit using JK flip-flops that takes in a binary streamBoB1 B2Bs and outputs a 1 at time t if the B-1Bt), when read as an unsigned binary number from low bit to high, stream received thusfar (i.e., BoB is divisible by 3. The following table depicts a sample input stream and what should be output. 0 2 345 678 Int01 00 Val of inu0 12 12 12 76 76 76 val mod 30 00 0 01 output Hint: The value of the new bit starts as equal to 1 which is 1 mod 3, then is 2 which is 2 mod 3, then is 4 which (a) Draw the state machine, numbering your states in an "obvious" manner. You may assume that the machine (b) Give the algebraic formula (simplified as much as possible) for the J and K inputs of your lip-lops, and is back to 1 mod 3, etc. starts in the right state at time t- 0. also for the output