in python 3

[2.5 pts] Write the recursive function is Prime(num) that takes an integer as a parameter and returns a boolean value, True if the number is prime, False otherwise. A prime number is a positive integer that has exactly two positive integer factors, 1 and itself. You can assume the function only receives integers If needed, the function could take a second argument, but it will not be provided by the user. This means it should be a preloaded value and the original function call will be fed only with num Remember to consider the special cases 0 and 1 Based on your recursive algorithm, you might encounter the runtime error maximum recursion depth exceeded when using large values of num. While changing the limit of recursive calls could solve the error, you should try to optimize your code rather than changing the recursion limit to accommodate an unoptimized algorithm. See the references at the end of this file for ideas on how to optimize your algorithm if needed