Write a java program to find the greatest common divisor (gcd) of two integers in two different ways [recursively and non-recursively]. For example, the gcd(102, 68) = 34.

// Procedure:

Step 1: Start the process

Step 2: Import the Scanner class from util package

Step 3: Create a class to hold the recursive implementation

Step 4: Create a class to hold non-recursive implementation

Step 5: Create a class to hold the main function

Step 6: Call the function gcd() and gcd2() to find the greatest common divisor.

Step 7: Print the two results.