Hi, I have in logisim 1x (8 bit inputs "A" ) , 1x (8 bit input "B"), 1x (1bit input "Set"),1x clock , I also have 1x (8 bit output "GCD"), 1x ( 1 bit output "done" ) with those I have to build a circuit that computes the Greatest Common Divisor (GCD) of two 8-bit unsigned integers, which are guaranteed to be greater than zero. The solution in hardware follows the solution in software you may have encountered earlier as it utilises Euclids algorithm. Euclids algorithm For two positive numbers A and B, repeat: if A=B, then the QCD=A, stop if A>B set A:=AB if A

Can anyone help me with this please?