Which of the following is TRUE regarding CPU scheduling?

As the ratio of time slice to job length decreases, round$-$robin scheduling becomes equivalent to first$-$ come$-$first$-$served.

Preemptive scheduling &es allow the scheduler to prevent starvation.

Round robin scheduling algorithm can give linear improvements in completion time when you run the same job mix on an identical machine that has a faster CPU.

Round robin CPU scheduling does well when faced with jobs of equal length