I need help with this, I don't know where to begin

7. Prime Numbers - SIEVE OF ERATOSTHENES A prime integer is any integer that is evenly divisible only by itself and I. The Sieve of Eratosthenes is a method of finding prime numbers. It operates as follows: Create an array with all elements initialized to 1 (true). Starting with array subscript 2, every time an array element is found whose value is 1, loop through the remainder of the array and set to zero every element whose subscript is a multiple of the subscript for the element with value 1. For array subscript 2, all elements beyond 2 in the array that are multiples of 2 will be set to zero (subscripts 4, 6, 8, 10, etc.); for array subscript 3, all elements beyond 3 in the array that are multiples of 3 will be set to zero (subscripts 6, 9, 12, 15, etc.), and so on. When this process is complete, the array elements that are still set to 1 indicate that the subscript is a prime number. Lastly, create an ArrayList containing only the prime numbers found. Write a program that finds and prints all the prime numbers smaller than a user-defined number. Write a program that finds and prints all the prime numbers smaller than a user-defined number OUTPUT You want to generate a list of all prime numbers smaller than...200 The prime numbers between 0 and 200 are... 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 There are a total of 46 prime numbers between 0 and 200