Write the recursive function gcd that takes two integers n and m and returns their greatest common divisor.
gcd
n
m
gcd(54, 26) -> 6
Test 1
Test 2
Test 3
Test 4
