Consider a disk with average rotational latency of 0.5 time units and transfer time of 0.1 time units per sector. The seek time for processing a request is 0, if the request is in the same cylinder that the disk head is currently in. Otherwise, let the seek time be 1 (k-1)*0.1 time units, where k is the number of cylinders travelled. Let the following table represent a stream of I/O requests for the disk: Request Arrival Time Cylinder Number of Sectors R1 t 51 2 R2 t 2 25 5 R3 t 4 62 2 R4 t 8 46 1 R5 t 17 35 5 R6 t 18 75 1 R7 t 20 14 2 Let the disk be scheduled using the Shortest Seek First (SSF) policy. Assume that the disk head is at cylinder 30 at time t, and no other requests enter the disk queue until all of the above requests are processed. Determine the schedule of processing for the above stream of requests. Based on the processing schedule, compute the wait times and turnaround times for all the requests. Note that the wait time of a request is the difference between the time at which the disk starts processing the request and the arrival time of the request; the turnaround time of a request is the difference between the time at which the disk completes processing the request and the arrival time of the request. Identify the TRUE statement among the following, with respect to the wait times and turnaround times of these requests.