Consider the following sets of processes, with the length of CPU burst time given in milliseconds: \(\begin{array}{|c|c|c|} \hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline P_1 & 8 & 4 \\ P_2 & 6 & 1 \\ P_3 & 1 & 2 \\ P_4 & 9 & 2 \\ P_5 & 3 & 3 \\ \hline \end{array}\)
The processes are assumed to have arrived in the order \( P_1, P_2, P_3, P_4, P_5 \) all at time 0.
Calculate the average waiting time of each process using FCFS scheduling.