code: def find_divisors(n):
  
      
  
      if not isinstance(n, int):
          raise TypeError("Expecting a strictly positive integer")
      if n <= 0:
          raise ValueError("Expecting a strictly positive integer")
  
      for i in range(1, int(n**0.5) + 1):
          if n % i == 0:
              divisors = {i, n//i}
              for divisor in divisors:
                  yield divisor
docs: Find all the positive divisors of the given integer n.
  
      Args:
          n (int): strictly positive integer
  
      Returns:
          A generator of all the positive divisors of n
  
      Raises:
          TypeError: if n is not an integer
          ValueError: if n is negative