Please give me BOX TRACE of this program.

// This program demonstrates a recursive function to calculate // the greatest common divisor (gcd) of two numbers. #include using namespace std; // Function prototype int gcd(int, int); int main() { int num1, num2; // Get two numbers. cout << "Enter two integers: "; cin >> num1 >> num2; // Display the GCD of the numbers. cout << "The greatest common divisor of " << num1; cout << " and " << num2 << " is "; cout << gcd(num1, num2) << endl; return 0; } //********************************************************** // Definition of gcd. This function uses recursion to * // calculate the greatest common divisor of two integers, * // passed into the parameters x and y. * //********************************************************** int gcd(int x, int y)

{ if (x % y == 0) return y; // Base case else return gcd(y, x % y); // Recursive case }