Prime Numbers Revisited

Modify your Prime number program to find all the prime numbers in a user-supplied range, using a function to determine the prime-ness of a single number. This function should incorporate the necessary logic from your previous program, and determine whether or not a single number is prime.

Function inputs: the number to determine the primeness of
Function outputs: whether or not the number is prime

Your main program should continue to handle all interaction with the screen and keyboard. To determine the primeness of multiple numbers, main will have to call your function multiple times.

Sample Run:

Enter the bottom of the range: 20
Enter the top of the range: 30
The prime numbers from 20-30 are:
23 29
Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.