Match List I with List II and choose the correct answer from the code given below.

1. A(a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)
2. B(a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)
3. C(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
4. D(a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: D. (a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)

Explanation

Per the key: greedy best-first (i), A*'s time depends on heuristic quality (iv), RBFS suffers from excessive node regeneration (iii), and IDA* avoids the overhead of a sorted queue (ii).