Extend the pseudocode for the Euclid's Algorithm so that it works even when 0 < b.

function GCD(a, b)

if b = 0 then

return a

else

return GCD (b, a mod b)

end-if

end-GCD

NOTE:

-recursive solution

-modify it so it preserves recursion, take into account the first number will be smaller.