Please help C++ please.

You will do a computer program that will ask the user to enter the size of a list. The size of the list will go from 1 to the size entered by the user. Your program will implement the sieve algorithm to create a list of prime numbers from 1 to size of list. The size of the list cannot be less than 2 . Each step of the list algorithm should be printed to the screen like the documentation. No boxes or strike throughs are needed. However, the composite numbers must be kept and shown that they have been eliminated. The loops used must stop when the square root of the max number has been reached. What I would like to see from you all first: 1. A well-planned approach to solving this problem. Show or indicate to the instructor that you understand the algorithm and know what will be needed to solve this program or project. 2. The project broken into smaller pieces and indicate to the instructor which piece should be solved first. 3. Then write the code, test each piece, and get it working, BEFORE starting on the next piece of the project. 4. Combine the pieces and then get the function working completely. Test the program with larger lists that the example and verify that you have the expected output