This is a question on disk scheduling. Everything is clearly marked. Thank you.

7. (18 points) Assme the disk hend starts a, track there arc 320 tracks (track 1 to track 300); a seek takes 25 +0.15 T millisecouds. where T is the number of tracks to move; latency is s 0 milliseconds, where T IS t.he number of tracks to move, latency is 10 milliseconds; and 1/O transfer takes 2 millisecondsethe requests alrendy, and the time they arrive (starting at timie 0) milliseconds. Here are the requests, all in the disk queue, arrival time for track (ms)0, 21, 25, 28, 30, 37, 42, 56, 86, 89, 98. ' 39, 224, 33, 23, 188, 254, 155, 189, 315, 75, 135 Compute the average time to service a request for each of the following disk scheduling algo- riths: SCAN, FCFS, SSTF. Also show the order of service for each algorithm