Suppose one of your classmates claims that the following boolean expressions represent the conversion from 4-bit Gray code to 4-bit binary numbers:
B3 = G3
B2 = G3 ⊕ G2
a. How many flip-flops would be required?
b. Sketch the circuit needed to implement this counter.