Which statement is valid for the shortest seek$-$time first $($SSTF$)$ algorithm

Which statement is valid for the shortest seek$-$time first $($SSTF$)$ algorithm

it is a non$-$priority based algorithm

total seek$-$time can be very high

no starvation problem

SSTF is used frequently nowadays