python-spyder coding needed

A prime number is a number that is only evenly divisible by itself and 1. For example, 3 is prime because it can only be evenly divided by 1 and 3. However 8 is not prime because it can be divided evenly by 1, 2, 4, and 8. Note that 1 is not a prime number and the smallest prime number is 2. Open PrimeNumbers.py and implement the function prime_numbers(n). Your function should print all of the prime numbers from 1 to n (included). Use the example function calls under main() to test your prime_numbers(n) function. eg.: When you call prime_numbers(20), your console should look like this: 2 3 5 7 11 13 17 19 Per primo_numbers(n): IMPLEMENT THIS FUNCTION. def main(): You can test your implementations using the function calls here. These are here only to help you test your functions. prime numbers (10) #prime numbers (20) #prime numbers (58) 10 11 12 13 14 15 16 17 18 19 20 DO NOT EDIT BELOW THIS LINE 000 11 name -'_main_ main()