How disk scheduling algorithms get the total distance (in cylinders) with the given information: i. A disk drive with 250 cylinders (0-249) ii. A request queue (98, 200, 37, 125, 15, 100, 26, 213) iii. Head pointer 50 Find and calculate the distance with the help of following algorithms. a) SSTE Calculation is: Total Distance: b) C-LOOK (Innermost) [4] Calculation is: Total Distance: c) SCAN (Innermost) [4M] Calculation is: Total Distance: d) LOOK (Outermost) (4M] Calculation is: Total Distance: e) According to the above techniques which seek strategy is better? Justify your answer. Total track travelled of with the total travel of less the others. Hence it is better than others