Which of the following scheduling algorithms can lead to "starvation" of processes?

In pure Priority Scheduling, a continuous stream of higher priority processes can indefinitely delay low-priority ones. Similarly, in Shortest Job First without aging, a steady arrival of short jobs can keep pushing back longer jobs. FCFS processes strictly in arrival order (no starvation by priority), and Round Robin gives every process a fair time slice in rotation, so neither causes starvation. The standard fix for starvation in priority-based scheduling is "aging" which means to gradually increase the priority of waiting processes.