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

Group of answer choices

chooses to service the request furthest from the current head position

services the request with the minimum seek time

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

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