In Disk scheduling, the seek time is the time for the disk arm to move the heads to the cylinder containing the desired sector. Consider the following

disk access request queue: $95,180,34,119,11,123,62,64$ with the Read$-$write head initially at the track $50$ and the tail track being at $199.$Show

the sequence and the total seek time in which the requests will be fulfilled for

a$)$ C$-$Scan scheduling

b$)$ Shortest seek time first