Suppose we use a disk scheduling algorithm, called Shortest Seek Time First (SSTF), which always serves the closest track first. (For example, if the r/w head is currently on track 53 and there are requests for data on tracks 57 and 46, it first serves the data block on track 57 and then the one on track 46.) Suppose the scheduler has requests for data on tracks: 14, 37, 65, 67, 98, 122, and124. If the r/w head is currently on track 53, what is the total number of tracks moved over to serve all these requests? For our example above, the answer is 15, obtained by adding 4+11 (4 moves from 53 to 57 and then 11 moves to 46).