Greatest Common Divisor 2016-07-14 algorithm Write a function to return GCD(Greatest Common Divisor) of two numbersexample:greatestCommonDivisor(14, 21);// 7;greatestCommonDivisor(69, 169);// 1; Newer Remove Duplicate Older Fibonacci Number