Question - A prime number is a number that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6.
Design a Boolean function named isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise.
Use the function in a program that prompts the user to enter a number and then displays a message indicating whether the number is prime.
Tip: Recall that the % operator divides one number by another and returns the remainder of the division.
In an expression such as n%m, the % operator will return 0 if n is evenly divisible by m, e.g., 10%5 returns 0.
Can you show me how to write a proper code for this problem and how to complete it. Thanks