input: Write a function to compute the greatest common divisor (GCD) of two given integers using the Euclidean algorithm. The function should take two integers as input and return their GCD. Use recursion to implement this function.
  def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)
  
  assert findGCD(1000, 500)==500
  assert findGCD(36, 60)==12
  assert findGCD(98, 56)==14
  assert findGCD(48, 18)==6
  assert findGCD(0, 0)==0
output: def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)