A. Write a method called sieve that takes an integer parameter, n, and returns a Boolean array that indicates, for each number from 0 to n - 1, whether the number is prime (The value should be true if the index is prime and false otherwise) using the sieve of Eratosthenes. For instance if sieve is invoked with n=8, the resulting array will be {false, false, true, true, false, true, false, true}. b. In your main method, Use Scanner to get an integer from the user.
c. Test the sieve method with the user input and display the result appropriately.