Match List I with List II and choose the correct answer from the code given below.
List I |
List II |
(a) |
Greedy Best-First Search |
(i) |
Selects a node for expansion if optimal path to that node has been found |
(b) |
A* Search |
(ii) |
Avoids substantial overhead associated with keeping the sorted queue of nodes |
(c) |
Recursive Best-First Search |
(iii) |
Suffers from excessive node generation |
(d) |
Iterative-deepening A* Search |
(iv) |
Time complexity depends on the quality of heuristic |
Code:
- (a) – (i), (b)-(ii), (c)-(iii), (d)-(iv)
- (a) – (iv), (b)-(i), (c)-(ii), (d)-(iii)
- (a) – (iv), (b)-(iii), (c)-(ii), (d)-(i)
- (a) – (i), (b)-(iv), (c)-(iii), (d)-(ii)