For FCFS:
A long process may make several short processes wait behind it. This is known as the convoy effect.
$\therefore \mathrm{I \rightarrow ii}$
For SJF:
SJF selects the process with the shortest CPU burst first and gives the minimum average waiting time for a given set of available processes.
$\therefore \mathrm{II \rightarrow i}$
For Round Robin:
Every ready process gets CPU time in cyclic order. Therefore, a ready process does not wait indefinitely under standard Round Robin scheduling.
$\therefore \mathrm{III \rightarrow iv}$
For SRTF:
SRTF requires knowledge or prediction of the remaining CPU burst time. Exact future CPU burst times are generally not known in advance.
$\therefore \mathrm{IV \rightarrow iii}$
Hence, the correct matching is:
$\therefore \mathrm{I-ii,\ II-i,\ III-iv,\ IV-iii}$
