Match the list I to list II

List I

List II

A) alpha-beta pruning

i) O(2(b^d/2))

B) Constraint satisfaction problems

ii) O( dⁿ)

C) min-max algorithm

iii)O(b^d/2)

D) Bi-directional search

iv) O(b^d)

Question

List I	List II
A) alpha-beta pruning	i) O(2(b^d/2))
B) Constraint satisfaction problems	ii) O( dⁿ)
C) min-max algorithm	iii)O(b^d/2)
D) Bi-directional search	iv) O(b^d)

Match the list I to list II List I List II A) alpha-beta pruning i) O(2(bd/2)) B) Constraint satisfaction problems ii) O( dn ) C) min-max algorithm iii)O(bd/2) D) Bi-directional search iv) O(bd)