input: Write a function to find the GCD of two numbers. Implement the function using the Euclidean algorithm and test it with provided values.
  
  def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)
  
  assert findGCD(1000, 500)==500
  assert findGCD(252, 105)==21
  assert findGCD(48, 18)==6
  assert findGCD(65, 14)==1
output: def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)