Consider the following pseudocode. What does it produce?

Create a list of consecutive integers from two to n $(2,3,4,...,$ n$).$

Initially, let p equal $2.$

Repeat the following steps until p is greater than n:

Remove all of the multiples of p less than or equal to n from the list.

If the list contains a number greater than p

Find the first number remaining in the list greater than p$.$

Replace p with this number.

Otherwise set p equal to n $+1$

Question $5$ options:

A$)$

All even numbers up to n

B$)$

All factorial numbers up to n

C$)$

All odd numbers up to n

D$)$

All prime numbers up to n