---

Solution

Stack algorithm is related to page replacement.

In page replacement, stack algorithms have the property that the set of pages in memory with fewer frames is always a subset of the set with more frames.

So,

$(A)-(III)$

Elevator algorithm is used in disk scheduling.

It is also known as the SCAN disk scheduling algorithm.

So,

$(B)-(II)$

Priority scheduling algorithm is a CPU scheduling algorithm.

In this algorithm, the process with higher priority is scheduled first.

So,

$(C)-(IV)$

Havender's algorithm is related to deadlock prevention.

It prevents deadlock by denying one of the necessary conditions for deadlock.

So,

$(D)-(I)$

Final matching is:

$(A)-(III), (B)-(II), (C)-(IV), (D)-(I)$