JAVA PROGRAM QUESTION. USE ARRAYS, we havent learned about boolean yet either no we cant use that(it its not possible without boolean than add it).

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 divisible by 1 and 5. The number 6 however is not prime because it can be divided evenly by 1, 2, 3 and 6, Write a method named isPrime which takes and integer value as an argument and returns true if the argument is a prime number and false otherwise. Demonstrate the method in a full program.

(Hint Recall the % operator divides one number by another and returns the remainder of the division.

In an expression num1%num2 the % operator will return 0 if num1 is evenly divisible by num2)