Consider a disk system with 100 cylinders. The request to access the cylinders occur in the following sequences
4, 37, 10, 7, 19, 73, 2, 15, 6, 20
Assuming the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first algorithm is used

A

95 ms

B

119 ms

C

233 ms

D

276 ms