Please write a function, gch, which takes two arguments x, y and calculates their greatest common divisor (GCD) using the Euclidean algorithm. The Euclidean Algorithm Example: Let a = 180 and b = 25 1. calculate 180/25, and get the result 7 with remainder 5, so 180 = 7 X 25 + 5. 2. calculate 25/5, and get the result 5 with remainder 0, so 25 = 5 x 5 -| 0. 3. the greatest common divisor of 180 and 25 is 5. Make use of gcd O to write a function, lcm(), which takes a vector and nd the least common multiple. The length of the vector will be at least two but no more than 100