How can I do this problem with Java?

Individual Exercise: Sieve of Eratosthenes The Sieve of Eratosthenes is a technique for finding all the prime numbers up to a given last number. It can be implemented as a program by using the algorithm (steps) given below. Create a variable for the last number initialized as 100 etc. (e.g, int lastNumber = 100; Create a boolean array isPrimell to keep track of which numbers up to lastNumber are prime. The length of the array must be equal to lastNumber + 1 as the array indexes start from zero. Note: The default value is false for all the array elements when a boolean array is created by using new. - Set all the array elements beginning from index = 2 (the first prime number) to true. Outer loop: Repeat the following steps for each number num within 2