Consider the following process id, arrival time, burst time/execution time and the priority. Assume that a low number implies a higher priority, the time quantum for RR is 4 ns, and the time for context switch is ignored. Identify which algorithm has the lowest waiting time for the processes What is the average waiting time for FCFS, SJF, Priority based, and round-robin scheduling algorithms, respectively?. Process Arrival Time Priority P1 0 1 1 Burst Time 8 4 9 5 P2 P3 3 2 4 3 2 4 13 4 Consider the following process id, arrival time, burst time/execution time and the priority. Assume that a low number implies a higher priority, the time quantum for RR is 4 ns, and the time for context switch is ignored. Identify which algorithm has the lowest waiting time for the processes What is the average waiting time for FCFS, SJF, Priority based, and round-robin scheduling algorithms, respectively?. Process Arrival Time Priority P1 0 1 1 Burst Time 8 4 9 5 P2 P3 3 2 4 3 2 4 13 4