Write a method named sieve that uses the "Sieve of Eratosthenes" algorithm to generate a list of prime numbers between 2 and a given maximum. You will represent the numbers using an array but return an ArrayList of the primes.

Algorithm:
Create a list of booleans(or ints) isPrime[2..n], all set to true.
Starting with p = 2, mark all multiples of p (i.e., 2p, 3p, ...) as false.
Move to the next unmarked number and repeat step 2.

Note the test cases do not check for effieciency so brute force will pass the test cases but please use the algorithm.