Process ID Arrival Time Burst Time P1 3 1 P2 1 4 P3 4 2 P4 6 P5 2 3

Consider the following processes:Process  Arrival Time  Service Time A 0 3 B 1 1 C 3 3 D 4 2 E 5 5 Show how the above processes execute over time on a single CPU system (i.e., please drawthe schedule where the x-axis is the time). Compute the completion time for each process,and the average turnaround time for all processes under each of the following schedulers:(a) FCFS.  (b) Round Robin with (q = 1). (c) Shortest Job First. (d) Shortest Remaining Time First. (e) HRRN.

Process F G H J K Arrival Time 2 3 11 17 24 Bust Time 4 9. 3 7 6. 12 Process P1 P2 P3 P4 Р5 P6 P7 Arrival Time 1 2 6. 7 4 Bust Time 1 3 4 1 2 1. Apply the following scheduling algorithms to the list of processes above. First-Come First-Serve Shortest Job First 2. For each process scheduling algorithm, provide the following: а. A complete and detailed table that contains the following criteria for each process Finish time Turnaround time Waiting time A detailed Gantt Chart The average turnaround time d. The average waiting time 3. Then, answer the following items b. c. Among the three (2) process scheduling algorithms that you have performed, which do you think is the most efficient and why? b. Cite significant differences in the results of applying the First-Come First-Serve algorithm and Shortest Job Firts algorithm. Elaborate on your answer. c. In your opinion, why does the average turnaround time and waiting time vary per algorithm? а.