Please write a full answer and explain it well

3. ?18%) Consider the processes P to F, with the following arrival times ai and service times di: Arrival time a0 1 4811 Service time d86453 Let the time quantum be 5. Determine the resulting schedule for the algorithms below and calculate the average residence time (it is sufficient to provide the result as a frac- tion, however calculate all differences and sums). Assume a single-core processor; the scheduler does not wait until al jobs have arrived, but starts immediately to make the first scheduling decisions; the arrival of a new process is non-preemptive in Round-Robin scheduling. (a) Shortest Job First (SJF) (496) (b) Shortest Remaining Time First (SRIF) (6%) (c) Round-Robin (RR) (8%) Use the Gantt chart below to fill in your solution: 0 2 3 4867 9 10 112 13 14 15 16 17 18 19 20 21 22 23 24 25 26 SJF SRTF 10 2 13 1 9 20 21 Average residence time SJF- Average residence time SRTF Average residence time RR