Programming C language

First n prime numbers: Write a program that takes a positive integer n as input and prints all the prime numbers from 1 to n. Hint: If you are not sure about prime number and how to approach the problem: A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. The first few prime numbers are {2, 3, 5, 7, 11, ...} Let's say we want to check whether a number N is a prime number or not. The idea to solve this problem is to iterate through all the numbers starting from 2 to N using a loop and for every number check if it divides N. If you find any number that divides, we conclude that N is not prime (you should break from the loop as you don't need check further for this number). If we did not find any number between 2 and N which divides N then it means that N is prime. But one challenge could arise when you need to know the reason why your loop breaks. Is it because we managed to divide or is it that the loop completed? So, after going out of the loop you need additional condition for the final decision. In this process, you might consider another variable that is initialized to 0 in the beginning. You change it in the loop if your number is not prime and you break from the loop. When you get outside of the loop you check whether the variable changed inside the loop or remained same. It will help you to make the decision. Additionally, a good idea would be create a function is prime() that takes an int and returns 1 or 0 indicating whether the passed number is prime or not. Sample Input/Output 1: Enter your n:20Prime number(s) from 1 to 20 : Sample Input/Output 2: Enter your n:2Prime number(s) from 1 to 2: Sample Input/Output 3: Enter your n: 1Prime number(s) from 1 to 1