Greatest Common Divisor $($GCD$)$: This circuit processes two $-$bit unsigned numbers $($A$,$ B$)$ and generates the GCD of

A and B$.$ For example:

$$ If A $=132,$ B $=72->$ GCD $=12.$

$$ If A $=216,$ B $=192->$ GCD $=24.$

$$ If A $=169,$ B $=63->$ GCD $=1.$

$$ The digital system $($based on a sequential algorithm$)$ is depicted in the figure below,

and includes an FSM $($in ASM$)$ and a datapath circuit.

$$ Complete the timing diagram of the digital system $($DA$,$ DB$,$

$,$ are decimal values$)$