Consider a disk that is scheduled using the Elevator policy. That is$,$ the disk head scans from the first cylinder to the last and back repeatedly, processing I$/$O requests along the way. However, the scan direction changes whenever there are no I$/$O requests in the disk queue in the direction of the scan, but there are I$/$O requests in the disk queue in the opposite direction.

Let the disk have an average rotational latency of $0\mathrm{.}5$ time units and transfer time of $0\mathrm{.}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\mathrm{.}1$ time units, where k is the number of cylinders travelled.

Let the following table represent the stream of I$/$O requests for the disk:

RequestArrival TimeCylinderNumber of SectorsR$1$t$765$R$2$t$+2652$R$3$t$+4872$R$4$t$+6761$R$5$t$+8955$R$6$t$+11442$R$7$t$+17435$R$8$t$+22541$

Assume that the disk head is at cylinder $50$ 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, identify the FALSE statement among the following, with respect to the relative order of processing the various requests.

Question $4$ options:

R$2$ is processed after R$3.$

R$2$ is processed before R$4.$

R$7$ is the last request processed.

R$1$ is processed before R$3.$ Consider a disk that is scheduled using the Elevator policy. That is$,$ the disk head scans from the first cylinder to the last and back repeatedly, processing I$/$O requests along the way. However, the scan direction changes whenever there are no I$/$O requests in the disk queue in the direction of the scan, but there are I$/$O requests in the disk queue in the opposite direction.

Let the disk have an average rotational latency of $0\mathrm{.}5$ time units and transfer time of $0\mathrm{.}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 $\backslash (1+($k$-1)^\{*\}0\mathrm{.}1\backslash )$ time units, where $\backslash ($ k $\backslash )$ is the number of cylinders travelled.

Let the following table represent the stream of I$/$O requests for the disk:

Assume that the disk head is at cylinder $50$ 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, identify the FALSE statement among the following, with respect to the relative order of processing the various requests.

R $2$ is processed after R$3.$

R$2$ is processed before R$4.$

$\backslash ($ R $7\backslash )$ is the last request processed.

R$1$ is processed before R$3.$