Consider a disk with tracks numbered from 0 to 255. The disk arm is moving towards highnumbered tracks and it takes Ims to travel from one track to the next adjacent one. While retrieving data from Track 52, the following list of requests has arrived: 185, 17, 124, 83, 40, 29, 76, 112 a. Identify the disk scheduling algorithms based on the following descriptions: i. Selects the disk 10 request that requires the least amount of travel from the current position of the disc arm, regardless of direction. ii. The disc arm moves back and forth over the disk, satisfying requests in its path. 1 b. Based on your answer in (a), perform disk scheduling analysis using these TWO (2) disks scheduling algorithms. Compute the average seek time for both algorithms. c. Based on your answer in (b), which algorithm performs better disk scheduling? Justify your