Five processes P1 through P5, arrive at a computer centre at almost the same time. They have estimated running times of 10, 6, 2, 4 and 8 seconds. Their (externally determined) priorities are 3, 5, 2, 1 and 4 respectively, with 5 being the highest priority. For each of the following scheduling algorithms, determine the average waiting time. Ignore process switching overhead. a) First Come First Served