We illustrate scheduling algorithms with a request queue $(0-199)$

$98,18,137,22,114,194,6,57$

Head pointer $53$

Calculate the total seek time if the scheduling is$,$

a$)$ FCFS $($First come, first serve$)$

b$)$ SSTF $($Shortest Seek Time First$)$

c$)$ Scan

d$)$ C$-$Scan

e$)$ C$-$LOOK