Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 12 ms, Job B = 24 ms, Job C = 30 ms, Job D = 18 ms, and Job E = 16 ms. a. Using First-Come First-Served, FCFS scheduling, in what order would they be processed? What is the total time required to process all five jobs? What is the average turnaround time foreach of these five jobs? [10] b. Using Shortest Job Next, SJN, and assuming that all jobs are present when the algorithm begins, in what order would they be processed? What is the total time required to process all five jobs? What is the average turnaround time for all five jobs? [10] c. Using SJN, and assuming that all jobs are present when the algorithm begins, what is the average turnaround time for all five jobs using these speeds: Job A = 16 ms, Job B = 18 ms, Job C = 30 ms, Job D = 24 ms, and Job E = 12 ms. [5]