This question relate to device management: Consider a disk with 300 tracks, and the following sequence of requested tracks 61, 149, 230, 48, 216, 54, 192, 262, 220, 255. Calculate the number of tracks crossed when the following algorithms are used. Assume that the disk starts at position 66. (i) First-come, first served. (ii) Shortest Seek (Time) First. (iii) Circular scan algorithm with a look function (i.e. the arm does not move to the boundaries of the disk if not required), moving in the up position