4. The Euclid algorithm for determining the GCD (greatest common divisor) of two integers x and y is described as below: Euclid (a, b) while b != 0 cfa%b afb bec return a Write a C++ program with a function written based on the above algorithm. Now call this function suitably by sending two inputs a and b. Before calling the function Euclid, must check if a>b, if not first swap them using a swap function