code: def square_root(n, epsilon=0.001):
      
      guess = n / 2
  
      while abs(guess * guess - n) > epsilon:
          guess = (guess + (n / guess)) / 2
  
      return guess
docs: Return square root of n, with maximum absolute error epsilon