Suppose that the head of a disk with 256 tracks, numbered 0 to 255, is currently serving a request at track 58. The previously served request was at a lower-numbered track (i.e., the head is currently moving from lower tracks to higher tracks). Assume that the queue of requests includes references to sectors in the following tracks (in order of arrival):

101, 46, 96, 31, 143, 69

For each of the following disk scheduling algorithms, indicate the sequence of tracks visited and the total head movement to satisfy these requests. [Total head movement means the total number of tracks swept by the head; e.g., the total head movement from track 23 to 47 and then to 10 is (47 - 23) + (47 - 10) = 61.]