[10 pts] Write an assembly function equivalent to the following C function. It implements the Euclids algorithm for computing the GCD (greatest common divisor) of two integers. Note this function is recursive. Your assembly function must be recursive, too, i.e. do not convert it to a loop.

unsigned gcd(unsigned a, unsigned b)

if (a == b)

return a;

if (a > b)

a = a - b;

else

b = b - a;

return gcd(a, b);