Write a program to find out GCD (greatest common divisor) using the following three algorithms. a) Euclid’s algorithm code example

function gcd(a, b)
    if b = 0
        return a
    else
        return gcd(b, a mod b)