A set of processes needs to be executed on a single CPU. The processes are identified by their

IDs $($P$1$ to P$3),$ and their CPU burst times are given in milliseconds. The arrival times are also

provided in milliseconds. Additionally, each process has a priority level $($High $=1,$ Medium $=2,$

and Low $=3).$ The processes are executed in the order of their arrival times. By using the Gantt

chart, Calculate the average waiting time and average turnaround time for these processes by

using the following algorithm and find out the best algorithm.

$$ FCFS $($First Come First Serve$)$

$$ Shortest Job First $($Pre$-$emptive$)$

$$ Shortest Job First $($Non Pre$-$emptive$)$

$$ Priority $($Pre$-$emptive$)$

$$ Priority $($Non Pre$-$emptive$)$

$$ Assume Time Quantum to be $3$ units of time. Calculate average waiting time and

average turnaround time by using Round Robin Scheduling.