Please write a full answer and explain well. Do not answer it if you do not know it!

Consider the processes P1 to P5 with the following service times di, arrival times ai, and priorities pi' Process Arrival time aj Service time di 14 18 4 Priority pimiddle low high middle high 0 A single-processor/single core system is used and the time quantum is 4. Show, for the schedul- ing algorithms below, the resulting schedules using a Gantt chart and calculate the average residence time and the average waiting time: 1. First Come First Served (FCFS), 2. Shortest Job First (SJF), 3. Shortest Remaining Time First (SRTF), 4. Round Robin (RR), 5. Round Robin with priorities (RRprio). (A note concerning round-robin scheduling: as said on the slides, newly arrived processes are appended to the tail of the ready queue; furthermore, if a new process (even one with a higher priority) arrives, another process that has already started its time slice is allowed to continue.)