Final answer:
SRTF and preemptive scheduling can cause starvation, and round robin is better than FCFS in terms of response time.
Step-by-step explanation:
Statement I: Shortest remaining time first (SRTF) scheduling may cause starvation. In SRTF, the process with the smallest remaining burst time is scheduled next. While this algorithm provides an optimal solution in terms of minimizing the turnaround time, it may lead to starvation if there are processes with larger burst times continuously arriving.
Statement II: Preemptive scheduling may cause starvation. Preemptive scheduling allows a process to be interrupted and another process to run. If a process keeps getting preempted by higher priority processes, it may never get a chance to complete, leading to starvation.
Statement III: Round robin scheduling is better than FCFS (First-Come-First-Serve) in terms of response time. Round robin scheduling ensures that all processes get an equal time slice for execution, resulting in a better response time compared to FCFS, where a long-running process can delay the response of other processes.
Therefore, the correct option is (d) I, II and III.