input: Write a function to print all prime numbers between 1 and a given number.
  assert print_primes(10)==[2, 3, 5, 7]
  assert print_primes(20)==[2, 3, 5, 7, 11, 13, 17, 19]
  assert print_primes(50)==[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
output: def print_primes(n):
      def is_prime(num):
          if num < 2:
              return False
          for i in range(2, int(num ** 0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      primes = []
      for num in range(2, n + 1):
          if is_prime(num):
              primes.append(num)
      
      return primes