Consider ten processes below in the table, all arriving at time zero. The length of the CRU burst time is given in milliseconds, Estimate the $1)$ Average waiting time, $2)$ Average turnaround time, and $3)$ Throughput using the following CPU scheduling algorithms. For throughput estimation consider the entire period of time. $(5$ Marks$)$

a$.$ First Come First Served $($FCFS$)$

b$.$ Shortest Job First $($SJF$)$

c$.$ Round Robin scheduling $($consider the quantum time of $10ms)$

d$.$ Priority scheduling $($the priority of each process is defined in the table$)$

$\backslash$table$[[$Process$,$Burst Time $($ms$),$Priority$],[$P$1,5,7],[$P$2,24,2],[$P$3,16,10],[$P$4,10,3],[$P$5,3,8],[$P$6,35,1],[$P$7,7,5],[$P$8,11,4],[$P$9,19,9],[$P$10,15,6]]$

In question no$.2$ above, compare the performance of the CPU scheduling algorithms. Also, write down the most efficient CPU scheduling algorithm in terms of average waiting time, average turnaround time, and throughput.

I really need the answer to number $3.$