Match List I with List II (space complexity)

List I	List II
(a) Hill climbing	(I) O(bd)
(b) Best first search	(II) O(bd)
(c) A* search	(III) O(1)
(d) Depth first search	(IV) O(bm)

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)-(IV)

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