There are five processes A, B, C, D and E with the following arrival times (in seconds), priorities (the higher the priority, the sooner the process is scheduled) and run times (in seconds). ABCDE arrival time priority run time 0 1 3 4 10 1 01 1 0 4 2 3 2 2 (a) Draw the process scheduling chart for those five processes A to E when using the first-come-first-served (without considering the priority) short-term scheduling algorithms. (5 marks) (b) Compute the average turnaround time for those five processes A to E using the first-come-first-served (without considering the priority) short-term scheduling algorithms.