Write a program in Java that consists of a isPrime method that takes an integer as a parameter and returns a Boolean value that indicates whether the parameter is a prime number(i.e. returns true if it is a prime number, false if it is not prime). The method signature should like this: public static boolean isPrime(int num)

In your main method, prompt the user to input a list of numbers. Assume that the input ends with number 0. The main method will make a call to isPrime for each number to determine whether that number is a prime number. The main method will display the results to the user.

Here's a sample run of the program:

Sample 1:

Enter numbers: 173 109 181 138 190 100 193 140 0

173 is a prime number

109 is a prime number

181 is a prime number

138 is not a prime number

190 is not a prime number

100 is not a prime number

193 is a prime number

140 is not a prime number

NOTE: Please name your file, Primes.java. Turn in "Primes.java" only.

*PLEASE LEAVE COMMENTS FOR THE STATEMENTS*