Question Number 2 Below mentioned is an algorithm. Step1:Get the number of process. Step2:Get the id and service time for each process.

i need solution of Part 3 and 4

Extracted text: Question Number 2 Below mentioned is an algorithm. Step1:Get the number of process. Step2:Get the id and service time for each process.


Extracted text: Step3:Initially the waiting time of first short process as 0 and total time of first short is process the service time of that process. Step4:Calculate the total time and waiting time of remaining process. Step5:Waiting time of one process is the total time of the previous process. Step6:Total time of process is calculated by adding the waiting time and service time of each process. Step7:Total waiting time calculated by adding the waiting time of cach process. Step8:Total turnaround time calculated by adding all total time of cach process. Step9:calculate average waiting time by dividing the total waiting time by total number of process. Step10:Calculate average turnaround time by dividing the total waiting time by total number of process. Step11:Display the result according to Table 2 Process Arrival Time Burst Time P1 P2 45 P3 1 64 P4 6. 4 P5 1 P6 12 98 P7 16 37 Table 2 1) Which Scheduling Algorithm is mentioned in this question? 2) Write and Compile C code of Algorithm mentioned above in Linux. Also display result according to Table 2. 3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2 a) Waiting time for all processes b) Average Waiting time c) Turn Around Time for all processes d) Average Turn Around Time