All parts are related with each other. Please answer all of them in C or C++ language

Write a function named prime() that determine whether or not a given number n (greater than one) is prime. The algorithm: Write a program that: If n is even then n is not a prime number except n = 2. For all odd numbers less or equal to the squareroot of n, if any of them divide n, then n is not prime Asks the user to enter an integer Saves the entry as var Calls the function prime() on the entry Displays whether or not the entry is prime 5. Write a function named eratos() that find all the prime number less than a given number, its argument n Write a program that: Asks the user to enter an integer Saves the entry as bound Passes bound onto eratos() Displays all the prime numbers less or equal to bound