How does the Shortest Remaining Time First (SRTF) algorithm differ from non-preemptive SJF?

A SRTF ignores burst time and schedules purely by arrival order, unlike SJF B SRTF only applies to I/O-bound processes, while SJF applies to CPU-bound ones C SRTF and non-preemptive SJF produce identical schedules in every case D SRTF can preempt the running process if a newly arrived process has a shorter remaining burst time, while non-preemptive SJF runs a chosen process to completion