Finding Prime Numbers in C.

So basically I need a C code to find prime numbers that uses this method but I need to write out the code and cannot use the function for the Sieve of Eratosthenes.

4. Prime Number Again This time we will implement a navel way of finding prime numbers. Let's say we want to find all the prime numbers less than or equal to 30, then it can be praceeded as follows: First generate a list af integers fram 2 to 30: 23 4E7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 2B 29 30 The first number in the list is 2; cross aut every 2nd number in the list after 2 by couating un from 2 in increments of 2 (these will be all the multiples of 2 in the list): 242s6 27 24 29 The next number in the list after 2 is 3; cross out every 3rd number in the list after 3 by couati p fram 3 in increments of 3 (these will be all the multiples of 3 in the list): The next number not yet crossed out in the list after 3 is 5; crass aut every 5th number in the list after S by counting,un from 5 in increments of 5 ie. all the multiples of 5): The next number not yet crossed out in the list after S is 7; the next step would be to crass aut every 7th number in the list after 7, but they are all already crassed out at this point, as these numbers(14, 21, 28) are also multiples of smaller primes because 7 x 7 is greater than 30, The numbers nat crossed out at this paint in the list are all the prime numbers below 30: 11 13 17 19 23 29 5000), then find and output all prime numbers that are Write a program to input an n (2sn less than ar equal to n Other Requirements Design your input and output nicely. Achieve the maximum efficiency. (Hint: Can you end ane of youe for lkaops in advance at