Consider a disk with 500 cylinders numbered from 0 to 499. Currently, the disk head is located at cylinder 250. There is a pending queue of disk access requests for cylinders at the following positions: 40, 180, 150, 270, 430, 320, and 110. You are required to simulate and calculate the total number of cylinders traversed by the disk head using the following disk scheduling algorithms: For SCAN and C-SCAN, assume the initial direction of the head movement is towards the higher numbered cylinders.

A. Calculate and list the order of servicing the disk access requests for each algorithm.

B. Determine the total head movement (in terms of cylinder numbers) for each algorithm.

C. Discuss the efficiency of each algorithm based on the total head movement and provide insight into which scenario each algorithm is best suited for.