Consider a disk that is scheduled using the shortest seek first (ssf) policy. at time t, let the disk have the following requests in its queue: request cylinder r1 45 r2 39 r3 49 r4 52 r5 69 r6 35 r7 3 r8 66. assume that the disk head is in cylinder 43 at time t and no other requests arrive until all of the above requests are processed. determine the schedule of processing for the above set of requests. based on the processing schedule, identify the true statement among the following, with respect to the relative order of processing the various requests.
a. r6 is processed after r4
b. r8 is processed before r6
c. r4 is processed after r8
d. r5 is processed before r4