Match List I with List II:
List I: (A) Stack algorithm (B) Elevator algorithm (C) Priority scheduling algorithm (D) Havender's algorithm
List II: (I) Deadlock (II) Disk scheduling (III) Page replacement (IV) CPU scheduling
Choose the correct match from A-D to I-IV.

Explanation

A stack algorithm (such as LRU) is a class of page replacement algorithms characterised by the property that the set of pages held for n frames is always a subset of the set held for n+1 frames (A-III). The elevator algorithm is simply another name for the SCAN disk scheduling algorithm, which services requests in one sweeping direction like an elevator (B-II). Priority scheduling is a CPU scheduling algorithm that dispatches the ready process with the highest priority (C-IV). Havender's algorithm is a classic approach to deadlock prevention, breaking one of the four necessary conditions (D-I). This gives A-III, B-II, C-IV, D-I, which is option (i).