Using the least slack scheduling algorithm I need a function that calculates the earliest starting time and latest starting time, and it needs to be recalculated if a machine is already in use

`int leastSlackScheduling(int earlStartTime[], int lateStartTime[], int numJobs) { int earlStartTime = 0; int lateStartTime = 0; int totalTime = 0; int earlStartTime[numJobs]; int lateStartTime[numJobs]; int i, j; for(i = 0; i <= numJobs; i++); { earlStartTime[i] = earlStartTime + earlStartTime[i-1]; } lateStartTime[numJobs - 1] = earlStartTime[numJobs - 1] + lateStartTime[numJobs - 1]; for(j = numJobs - 2; j >= 0; j--); { lateStartTime[j] = max(earlStartTime[j] + lateStartTime[j], lateStartTime[j + 1] - earlStartTime[j + 1]); if(lateStartTime[j] == (earl`