Scenario: Prime Number Generator with Sieve of Eratosthenes

Description: You are given a task to implement a program that generates prime

numbers up to a specified limit using the Sieve of Eratosthenes algorithm. The

program should prompt the user to enter the upper limit for prime number generation $.$Java code

and then display all prime numbers up to that limit$.$

Requirements:

$$ Prompt the user to enter an upper limit N for prime number generation.

$$ Implement the Sieve of Eratosthenes algorithm to generate all prime numbers up

to N$.$

$$ Use a Boolean array to mark all numbers as prime or composite.

$$ Iterate through the array using a for loop to mark multiples of each prime number

as composite.

$$ Display all prime numbers found up to the specified limit N$.$

Challenges:

$$ Efficiently implement the Sieve of Eratosthenes algorithm to handle large values of N$.$

$$ Ensure that the program handles user input validation to prevent invalid inputs.

$$ Optimize the program for performance and memory usage, especially for larger values

of N$.$