Design and implement a program that implements Euclids algorithm for finding the greatest common divisor of two positive integers. The greatest common divisor is the largest integer that divides both values without producing a remainder. An iterative version of this method was part of the RationalNumber class presented in Chapter 6. In a class called DivisorCalc, define a static method called gcd that accepts two integers,

num1 and num2. Create a driver to test your implementation. The recursive algorithm is derived as follows:

- gcd(num1, num2) is num2 if num2<=num1 and num2 divides num1

- gcd(num1, num2) is gcd(num2, num1) if num1

- gcd(num1, num2) is gcd(num2, num1%num2) otherwise