Find the following process table. Perform pre-emptive SJF and pre-emptive priority scheduling. Draw Gantt Chart. Find out the waiting time, completion time and turnaround time of each process in ready queue. Find out the average waiting time and average turnaround time. Which scheduling algorithm gives the best performance? Analyze. Process Priority P1 P2 P3 P4 P5 Arrival Time 0 1 2 3 5 Burst Time (ms) 8 10 4 5 6 2 3 5 4 1 UN