input: Write a function to generate and print all prime numbers between 1 and a given number n. If n is less than 2, the function should return a message stating that there are no prime numbers within the specified range.
  assert generate_prime_numbers(10)
  assert generate_prime_numbers(2)
  assert generate_prime_numbers(1)=='There are no prime numbers in the given range.'
  assert generate_prime_numbers(0)=='There are no prime numbers in the given range.'
  assert generate_prime_numbers(20)
output: def generate_prime_numbers(n):
      if n < 2:
          return 'There are no prime numbers in the given range.'
      primes = []
      for num in range(2, n + 1):
          for i in range(2, num):
              if (num % i) == 0:
                  break
          else:
              primes.append(num)
      return primes