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.

public class GenericQueue { private java.util.LinkedList list = new java.util.LinkedList();

public void enqueue(E e){ list.addLast(e); }

public E dequeue(){ return list.removeFirst(); }

public int getSize(){ return list.size(); }

@override

public String toString(){

return "Queue: " + list.toString(); }

----------

public static boolean isPrime(int n){ for (int i=2; i<= n/2; i++){ if (n % i== 0) return false; } return true; }