I need this in C programming not in C++ or Java or anything else please and thank you in advance.

2 Prime Numbers A number is called a prime if it has exactly two positive divisors, itself and 1. One way to test if a number n is prime is to check if n is divisible by any number from 2 to n (dividing with numbers larger than Vn has no additional benefit to testing for primality). For instance, consider checking the primality of 17. The square root of 17 is 4.1, so it is sufficient to test if 17 is divisible by 2, 3, and 4. Since 17 is not divisible by any of those numbers, 17 is deemed to be prime. The first 6 prime numbers are 2, 3, 5, 7, 11, 13 1. Develop a function called isPrime that receives as input an int n and returs 1 if n is a prime and0 otherwise. Use the following function prototype: int isPrime(int num); 2. Write a main function that asserts the isPrime function for the following test iputs: 0, 1, 2, 3, 4, 5 10, 1, 13, 15, 17 3, write a main function that asks the user to enter an integer r and prints all prime nurnbers up to Ensure that you use the isPrime function in the main Sample Code Execution: Enter the value of x: 20 2, 3, 5, 7, 11, 13, 17, 19 Do you want to continue (y)?: y Enter the value of x: 12 2, 3, 5, 7, 11 Do you want to continue (y)?:n Goodbye