a) Write a Boolean function named prime which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Test your function with a program that prompts the user to enter a number then displays a message indicating whether the number is prime or not. b) Write another program that displays all of the prime numbers from 1 to 100. Hint: use a loop that calls the prime function.