This code must be in c++ only.
The Greatest Common Divisor [GCD] Directions: Implement the Euclidean Algorithm to compute the greatest common divisor of any two integers. These two integers should be able to be positive, negative, zero, or any combination thereof. Input: 2 integers Output: 1 integer (ie: the gcd of the given integers)