use the Well-Ordering principle to prove the given theorem

2. The Sieve of Eratosthanes is an algorithmic method of identifying all prime numbers between 2 and some positive integer n. First circle 2. Then cross off all multiples of 2. Repeat the following: Circle the lowest integer that is not crossed off; and cross off all of its multiples. Question. Use the Well-Ordering Principle to prove that a fixed integer n at least 2, the Sieve of Eratosthanes correctly identifies (circles) the primes and excludes (crosses off) the composites.