C++ code for MyProgrammingLab

The greatest common divisor of integers x and y is the largest integer that evenly divides both x and y. Write a recursive function gcd that returns the greatest common divisor of x and y, defined recursively as follows: * If y is equal to 0, then gcd(x,y) is x; * Otherwise, gcd(x,y) is gcd(y,x%y) where % is the modulus operator. Write a test program that prompts the user to enter two integers and then calculates and outputs their greatest common divisor using your recursive function. Note: in order for this algorithm to work, x must be greater than y; if the value user enters for y is greater than x, your program will have to swap them.