Which disk scheduling algorithm always selects the request that requires the least movement of the disk head?

First$-$in$-$first$-$out $($FIFO$)$

Scan

C$-$scan

Shortest seek time first $($SSTF$)$