Write a Java program that uses a value-returning method to identify the prime numbers between 2 bounds (input from the user). The method should identify if a number is prime or not. Call it in a loop for all numbers between the 2 bounds and display only prime numbers. Check for errors in input.Note:A number is prime if it is larger than 1 and it is divisible only by 1 and itself(Note: 1 is NOT a prime number)Example:15 is NOT prime because 15 is divisible by 1, 3, 5, and 15; 19 is prime because 19 is divisible only by 1 and 19.

Answer:

Answered below.

Explanation:

public int[] primeNumbers(int lowBound, int highBound){

if(lowBound < 0 || highBound < 0 || lowBound >= highBound){

System.out.print("invalid inputs");

else if(highBound <= 1){

System.out.print("No prime numbers);

}

else{

int[] nums;

for(int I = lowBound; I <= highBound; I++){

if(isPrime (I)){

nums.add(I);

}

}

return nums;

}

Open Office software is an example of what software

arrange the following numbers from the highest to the lowest. ⅔,-7,0. no file or photo​

whats the most popular social networking in the philippines?

Programming a computer to win at chess
has been discussed since the
A. 1940's
B. 1950's
C. 1960's