Is Prime Function Write a well-documented Python program, hmwk4Q1.py, that defines a function isPrime.py(N). The function accepts an integer N and returns True if N is a prime number, otherwise, returns False. Next, define the main function that asks the user for a range of numbers, say from 2 to M, and counts how many prime numbers there are within the range.

python3 Write a recursive function called is_palindrome(string) that takes a string parameter and checks if it is a palindrome ignoring the spaces, if any, and returns True/False. Sample output:>>> print(is_palindrome("never odd or even"))True>>> print(is_palindrome("step on no pets"))True

Write a python program with the following functions:1. the function factorial_loop(num) that takes an integer num and returns the value of the factorial of num written as num!, where num! = num * (num-1) * (num-2) * ... * 2 * 1. This function must use a loop (iteration) to compute the value of num!.2. the function factorial_recursive(num) that takes an integer num and returns the value of the factorial of num (i.e., num!) as defined above. This function must use a recursive algorithm to compute the value of num!.

Write a function called isValidLength that takes an integer number and returns true if the number has a valid length and false otherwise. Valid- length is determined by finding number length. If the length is at least 3 digits and at most 5 digits, then the number has a valid length. For example, the number 324 is valid because it's 3 digits long and the number 22 is invalid because it’s 2 digits long.

Write a function "gcDivisor" that takes two positive int "k" and "m" and returns the greatest common divisor of these two positive integers. Using recusion in python3.

write a function on_orangeline(station) that returns True if the station is on the Orange Line use python