a. Given a disk with 200 tracks in total, where disk requests are received for the tracks in the following order: 85, 58, 60, 39, 18, 90, 160, 38, 184 Given the disk arm is currently on track 85, calculate the number of tracks traversed when the head is moving towards the end and C-SCAN algorithm is used for disk scheduling? b. Assume in this file system data are updated infrequently and accessed frequently in random order. Which disk allocation method would maximize efficiency in terms of speed of access, use of storage space, ease of update? Discuss your choice.