Write a program that displays the first 50 prime numbers in ascending order. Use a generic queue given below to store the prime numbers. Also, use the given method isPrime () to determine whether the number is prime or not.

Java program given below

Explanation:

Java Code: Save this file as Main. java and keep This file and GenericQueue. java in same folder

class Main {

public static boolean isPrime (int n) {

for (int i=2; i< = n/2; i++) {

if (n % i= = 0)

return false;

}

return true;

}

public static void main (String[] args) {

GenericQueue queue = new GenericQueue ();

int n = 0, p = 2;

while (n < = 50)

{

if (isPrime (p))

{

queue. enqueue (p);

n++;

}

p++;

}

System. out. println (queue);

}

}