The SCAN disk scheduling algorithm $\_\_\_\_.$

A$)$ services the request with the minimum seek time

B$)$ services the request next to the current head position in the direction of the head movement

C$)$ chooses to service the request furthest from the current head position

D$)$ services the request next to the current head position in the opposite direction of the head movement