$(20p)$ Draw the state diagram of the circuit which finds whether a number is divisible by $3$ or not. There is one input ine $x$ and one output line $y.$ The bits of the number are input to the circuit starting from the least$-$significant bit, one bit at each clock cycle. After each clock, the output should indicate whether the number entered so far is divisible by $)=(1$ or not $)=(0.$