In what sense is the construction of functions the construction of primitives? The Euclidean algorithm finds the greatest common divisor of two positive integers X and Y by the following process: As...

In what sense is the construction of functions the construction of primitives? The Euclidean algorithm finds the greatest common divisor of two positive integers X and Y by the following process: As long as the value of neither X nor Y is zero, assign the larger the remainder of dividing the larger by the smaller. The greatest common divisor, if it exists, will be the remaining non-zero value. Express this algorithm in our pseudocode.