Write a function gcd(x, y)that returns the greatest common divisor of the parameters candy. You can use the Euclidean algorithm, which uses the fact that gcd(x,y) = gcd(modx,x). Say you want to nd the gcd of 462 and 1071