Exercise: A Recursive GCD Function One of the oldest known algorithms that is worthy of the title is Euclid's algorithm for computing the greatest common divisor (GCD) of two integers, x and y. Euclid's algorithm is usually implemented iteratively using code that looks like this: int GCD(int x, int y){ int r = x y; while (r != 0) { x = y; y = r; r = x y; } return y; } Rewrite this method so that it uses recursion instead of iteration, taking advantage of Euclid's insight that the greatest common divisor of x and y is also the greatest common divisor of y and the remainder of x divided by y. CSC 244 Concepts of Algorithms 10