Java please

Write a recursive method GCD(n, m) that returns the greatest common divisor of two integers n and m according to the following: GCD(n, m) n, if m=0 otherwise GCD(m, n mod m)