The Sieve of Eratosthenes is a method of finding prime numbers.

Write a Java program which implements described algorithm for an array of 1000 elements. Your class MUST have the following methods:

• public static void main(String[] args) - creates array of integers int[] a and calls methods init(a), findPrimes(a)and printPrimes(a)
• public static void init(int[] a) - takes a reference to array of integers and initializes all elements to 1, except elements at 0 and 1
• public static void findPrimes(int[] a) - implements the algorithm of Eratosthenes
• public static void printPrimes(int[] a) - prints prime numbers in the range 2 to 999.