Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and arrival time. Table 1 Process Arrival Time (ms) Burst Time (ms) Priority* P1 3 P2 1 2 1 P3 3 P4 7...

Extracted text: Given in Table 1 is a set of five (5) processes with the priority, length of the CPU-burst time, and arrival time. Table 1 Process Arrival Time (ms) Burst Time (ms) Priority* P1 3 P2 1 2 1 P3 3 P4 7 P5 8 8 4. *Note: • A smaller priority number implies a higher priority. a) Compute the Waiting Time (WT) of each process in Table 1, and also compute their Average Waiting Time, for each of the following scheduling algorithms. i. Shortest Job First (SJF). ii. Pre-emptive Priority (PP) iii. Round Robin (RR) with quantum = 3 (ms).