Someone please convert this code to C language from C++ #include #include #include #include #include

using namespace std;

// Function to factors of the given // number vector getFactorization(int x) { int count = 0; vector v; // Loop to find the divisors of // the number 2 while (x % 2 == 0) { count++; x = x / 2; } if (count != 0) v.push_back(count); // Loop to find the divisors of the // given number upto SQRT(N) for (int i = 3; i <= sqrt(x); i += 2) { count = 0; while (x % i == 0) { count++; x /= i; } if (count != 0) v.push_back(count); } // Condition to check if the rest // number is also a prime number if (x > 1) { v.push_back(1); } return v; } // Function to find the non-prime // divisors of the given number int nonPrimeDivisors(int N) { vector v = getFactorization(N); int ret = 1; // Loop to count the number of // the total divisors of given number for (int i = 0; i < v.size(); i++) ret = ret * (v[i] + 1); ret = ret - v.size(); return ret; }

int main() { int n = 10; pid_t childpid;

for ( int i = 0; i < n; ++i ) { if ( ( childpid = fork()) <= 0 ) break; //child or error, break cout <<"The Prime Factors of "<