Write the definition of a function that takes in an integer number, and returns 1 if the number is prime, otherwise, returns 0. A prime number is only divisible by itself and 1. Do not write the code for main here. The code must follow these steps in the order shown: name the function isPrime, and make it take one parameter n as an integer. decide what the return type must be. test if n is <= 1, then return 0. if the previous step is false, then: use a for loop, with i as the loop counter, starting at n -1, continuing only if i >= 2, while decrementing i by 1 each iteration. the for loop body should check if the remainder of dividing n by i is equal to 0. There is an operator that returns the remainder of division which must be used here. If the remainder of dividing n by i is equal to 0 then return 0 - do not do anything otherwise inside the loop. if the for loop ends, return 1. Make sure you have no syntax errors and declare all used variables. Do not add any other code. Do not add code for main here.

c language