$3.$ The following C $-$like code calculates the greatest common divisor $($GCD$)$ of the two $8-$bit positive integers a and b $($Aside: This is Euclid's algorithm from $300$ BC $).$ Complete the HLSM for the code.

$($Responses must adhere to case sensitivity and refrain from using spaces in the answers.$)$

Inputs: byte a$,$ byte b$,$ bit go

Outputs: byte gcd$,$ bit done

GCD:

while $(1)\backslash \{$

while $(!$go$)$;

done $=0$;

while $($V$)\backslash \{$

if $(\backslash ($ a$>$b $\backslash ))\backslash \{$

$\backslash ($ a$=$a$-$b ; $\backslash )$

$\backslash \}$

else $\backslash \{$

b $=$ b $-$ a;

$\backslash \}$

$\backslash \}$

gcd $=$ a;

done $\backslash (=\backslash$mathrm$\{$W$\}\backslash )$;

$\backslash \}$

$\backslash ($ X$=\backslash )$