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

A

190

B

238

C

233

D

276