show all work please!!

This week we are going to simplify last week's program with the use of a Function. The code below is the code shown in class last week. This week we need to replace the code in the black rectangle with a function called, check_if_prime(); #include #define TRUE 1 #define FALSE O 1/function prototype goes here int main (void) { unsigned int nth prime, number of primes; unsigned int test_int, divisor; Bool isPrime; printf("Enter the nth_prime to find:"); scanf("u", Enth_prime); number of primes - 6; test_int - 1; test_int++; isPrime=TRUE; //assume test_int is prime until proven not to be for(divisor = 2; divisor