Consider the following terminology and match List 1 and List 2 and choose the correct answer from the code given below

b = branch factor

d = depth of shallowest solution

M = Maximum depth of the search tree

I = depth limit

List 1

List 2

a) BFS

i) O(bd)

b) DFS

ii) O(b^d)

c) Depth – Limited Search

iii) O(bm)

d) Iterative deepening Search

iv) O(bl)

Question

List 1	List 2
a) BFS	i) O(bd)
b) DFS	ii) O(b^d)
c) Depth – Limited Search	iii) O(bm)
d) Iterative deepening Search	iv) O(bl)