Problem 1 You are running an application in which five processes are started nearly simultaneously, i.e., assume their arrival time = 0. Their estimated time to execute (i.e., their needed CPU time/cycle) are as follows: P1 = 3 ms, P2 =11 ms, P3 = 16 ms, P4 = 6 ms, P5 = 2 ms 1. [Question] Answer the four questions below for FIFO (First-In-First-Out Scheduling). In what order do the processes run? What is the total turnaround time required for all processes (it would be incorrect if you simply add the numbers above together)? What is the average turnaround time for the five processes? (Add the total time required for each process and divide by the number of processes.) 2. [Question] Now answer the same set of questions for SJF (Shortest-Job-First) Scheduling. 3. [Question] How do the scheduling algorithms compare in performance for this particular case (turnaround time)? Problem 2 An application is running with STCF (Shortest Time-to-Completion First) processing. Seven processes enter the system at the arrival times listed below and with the corresponding CPU burst cycle (CPU Burst Cycle is how much time the process totally needs to run) allocated to each. 1. [Question] Indicate the order in which the jobs run to completion (the order of completion). 2. [Question] Include a visual timeline indicating the scheduling process (any type of graph will be acceptable). 3. [Question] Finally, calculate the average turnaround time. 1 Process ID 1 Arrival Time CPU Burst Cycle 0 2 1 3 12 4 34567 7 2 4 5 7 852 8 2