Suppose that the head of a disk drive is currently at track 9, that the disk has 32 tracks per surface, and the disk-queue contains the following sequence of access requests: Request 1 2 3 4 5 6 7 8 Track 18 22 14 26 10 30 75 For each of the following disk scheduling algorithms, find the total distance (in tracks) that the disk head moves. Please make your answer boldface.