input: Write a function to take a number as input and return a list of all its divisors. The function should iterate through all numbers from 1 to the given number and check if they are divisors by using the modulus operator. If a number is a divisor, it should be added to the list of divisors, which is then returned.
  
  
  def find_divisors(num):
      divisors = []
      for i in range(1, num + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors
  
  assert find_divisors(6) == [1, 2, 3, 6]
  assert find_divisors(10) == [1, 2, 5, 10]
  assert find_divisors(15) == [1, 3, 5, 15]
  assert find_divisors(20) == [1, 2, 4, 5, 10, 20]
  assert find_divisors(1) == [1]
  
output: def find_divisors(num):
      divisors = []
      for i in range(1, num + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors