Implement a recursive method that evaluates the GCD of the given numbers.
Question: The Euclidean algorithm for the GCD (greatest common divisor) of two positive integers is the world's oldest surviving non-trivial algorithm. It has many theoretical and practical applications.
For case, it is used in the public key encryption system that is used to secure electronic commerce.
It has a short recursive implementation based on the given two facts.
gcd(a; b) = {a if b = 0;
{gcd(b; a%b) otherwise.
Use the above fact to create a recursive method in Java that computes and returns the gcd of two positive integers. Comment the code.