Write code in Java

3) Implement the Sieve of Eratosthenes in a method:

boolean [] sieve(int n)

sieve() returns an array of n + 1 booleans (0 - n, inclusive) where index i of the array is true if and only if i is prime.

You may not use isPrime(), and nor may your isPrime() solution use output from sieve().

For instance, sieve(12) returns an array containing the values:

false false true true false true false true false false false true

corresproding with the integers 0 1 2 3 4 5 6 7 8 9 10 11