Match List - I with List - II.

1. A(a)-(III), (b)-(I), (c)-(IV), (d)-(II)
2. B(a)-(II), (b)-(I), (c)-(IV), (d)-(III)
3. C(a)-(II), (b)-(IV), (c)-(I), (d)-(III)
4. D(a)-(I), (b)-(III), (c)-(II), (d)-(I)

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

Show answer & explanation

Correct answer: A. (a)-(III), (b)-(I), (c)-(IV), (d)-(II)

Explanation

Hill climbing keeps only the current state, O(1). Best-first search stores up to O(b^d) nodes. Following the official key, A* is matched with O(b^m) and depth-first search with O(bd) (its linear space bound).