I need this code that is written in CPP to be changed so it is runnable in C:

//corrected program for finding prime no between 0 to 127 by implementing Sieve of eratosthenes #include using namespace std; #define limit 127 int main() { int sieveArray[limit] = {0}, i, j; //all the elements initializes to zero for (i = 2; i < limit; i++) //each non-prime elements index is marked as 1 { for (j = i * i; j < limit; j+=i) //update all multiples of sieveArray[i] { sieveArray[j - 1] = 1; } } for (i = 2; i < limit; i++) //1 is not included because it's not prime { if (sieveArray[i - 1] == 0) //if element is 0 means the index no. is prime else not prime. cout << i << "\t"; } } //end of main