5. (problem found in both stallings and tanenbaum): five batch jobs, a through e, arrive at a computer at essentially the same time. they have an estimated running time of 15, 9, 3, 6, and 12 minutes, respectively. their (externally defined) priorities are 6, 3, 7, 9, and 4, respectively, with a lower value corresponding to a higher priority. for each of the following scheduling algorithms, determine the turnaround time for each process and the average turnaround for all jobs. ignore process switching overhead. explain how you arrived at your answers. in the last three cases, assume only one job at a time runs until it finishes, and all jobs are completely processor bound.