input: Write a function called findGCD that calculates the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. The function should take two arguments a and b and return the GCD of these two numbers. If the second number is 0, the function should return the first number as the GCD. If the second number is not 0, the function should recursively call itself with the second number and the remainder of the division of the first number by the second number. Also, write a test script to find the GCD of 1000 and 500 using this function and print the result.
  
  def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)
      
  a = 1000
  b = 500
  print("GCD of number is: ", findGCD(a, b))
output: def findGCD(a, b): 
     if (b == 0): 
         return a
     return findGCD(b, a % b)