• In Java Please
• Write a program to find the prime numbers

• Ask user to input the integer number
• test the number whether it is a prime number or not
• Then, print true or false depending on whether the number is prime or isnt.
• Hint: number is prime when is has exactly 2 factors: one and itself. By this definition, number 1 is a special case and is NOT a prime.
• Use idea of user input, cumulative sum, and loop to solve this problem. You can assume user inputs positive number.