I want a java program with the output

4) The sieve of Eratosthenes is an efficient method for computing primes upto a certain number. We first look at the algorithm and then give a program in Java for the same Implement using Queue. The technique is known as the Sieve of Eratosthenes The algorithm is described by the following pseudocode: create a queue and fill it with the consecutive integers 2 through n inclusive. create an empty queue to store primes. do obtain the next prime p by removing the first value in the queue of put p into the queue of primes. go through the queue of numbers, eliminating numbers divisible by p while (p