Consider the following $6 \;\mathrm{I} / \mathrm{O}$ operations and their respective cylinder locations on disk. Seek time is $0.1$ milliseconds per cylinder traversed. The cylinders are numbered from $0$ to $99.$
$$
\begin{array}{|l|l|l|l|l|l|l|}
\hline \textbf{Operation} & A & B & C & D & E & F \\
\hline \textbf{Cylinder} & 4 & 10 & 35 & 62 & 69 & 95 \\
\hline
\end{array}
$$
We use the Shortest Seek Time First disk scheduling algorithm to schedule these operations. The arm begins at cylinder $33.$ The total seek time comes out to be $\mathrm{X}$ milliseconds (Ignore rotational and transfer delays).
Unhappy with this seek time, we decide to use LOOK as our disk scheduling algorithm instead. Assume LOOK begins by traversing descending cylinder numbers starting with the disk arm at cylinder $33.$ The total time we spend seeking is $\mathrm{Y}$ milliseconds. What is $10 \ast(\mathrm{X}-\mathrm{Y})?$
