Answer:
Answered below.
Step-by-step 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;
}