Calculate the following: $($a$)$ waiting time for each process; $($b$)$ average waiting time; $($c$)$ order of completion of processes; when each of the following four scheduling algorithms is applied:

i$.$ Shortest Remaining Time First $($SRTF$)$

ii$.$ Round Robin $($RR$),$ where time slice is equal to $2$ms$.$