Operating systems

1. (28 pts.) Consider a single-sided disk with one recordable surface where the tracks are numbered from zero to 49. Given the following: o it takes 1 ms to travel from one track to the next o the arm is originally positioned at track 25 moving towards the lower numbered tracks Using the scheduling policy specified below, compute how long it will take to satisfy the following requests Arrival Time (ms) Seek Location 10 20 42 32 10 15 20 25 30 35 40 24 25 45 a. First Come First Served (FCFS) b. Shortest Seek Time First(SSTF) nonpreemptive c. Shortest Seek Time First(SSTF) preemptive d. N-Step SCAN scheduling policy e. SCAN scheduling policy f. LOOK scheduling policy g. C-SCAN scheduling policy (assume the outward scan takes 0.5 ms per track) h. C-LOOK scheduling policy (assume the outward scan takes 0.5 ms per track)