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.