in C language

1) Write a function called is prime which takes an integer as parameter and checks whether itself. 2 is prime, 1 is not prime) If the integer is prime, your function will return 1, otherwise it will return 0 2) Write a function called is_germain prime which takes an integer as parameter and checks whether the integer is a germain prime or not. (A germain prime is a number p such that p is prime and 2p+ 1 is also prime) If the integer is a germain prime, your function will return 1, otherwise it will return 0 hint: use the is_prime function 3) Write a program which takes two integers x and y (you may assume that x and y are greater than 2) and prints the germain primes between (and including) x and y in ascending order hint: use the is_germain_prime function