Write a recursive program to obtain the GCD (greatest common divisor) of two positive integers m and n by implementing the Euclids method. (Language is Java)

Euclids GCD algorithm app utilizes the following rule to compute GCD of two numbers m and n:

Sample Run 1:

Input:

Enter two numbers: 30 24

Output:

The GCD is 6

Sample Run 2:

Input:

Enter two numbers: 27 3

Output:

The GCD is 3