Write a C program which finds and prints the even number less than 1000, say k, which has the largest partition count. If there is more than one number with the same partition count, you just have to output the smallest of them. 1. Your program should output the number k together with its partition count. 2. It should also output the average value of the partition count for all even numbers less than 1000. 3. Then, your program should then output all the Goldbach partitions of the number k. You must define and use a function to determine if a number is prime. The prototype for the function should be: int isPrime (int); This function takes an integer argument and returns 1 if it is a prime number and 0 otherwise