Consider the following terminology and match

List I with List II and choose the correct answer from the code given below. b= branching factor d= depth of the shallowest solution m= Maximum depth of the search tree l = Depth limit

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

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

Show answer & explanation

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

Explanation

BFS stores the frontier, O(b^d); DFS O(bm); depth-limited O(bl); iterative deepening O(bd).