Match List-I with List-II

List I

List II

A.
Greedy Best first search
I.
The space complexity as O(d) where d = depth of the deepest optimal solution

B.
A^*
II.
Incomplete even if the search space is finite

C.
Recursive best first search
III.
Optimal if optimal solution is reachable otherwise return the best reachable optimal solution

D.
SMA^*
IV.
Computation and space complexity is two light

Choose the correct answer from the options given below :

A - II, B - IV, C - I, D - III

A - II, B - III, C - I, D - IV

A - III, B - II, C - IV, D - I

A - III, B - IV, C - II, D - I

List I		List II
A.	Greedy Best first search	I.	The space complexity as O(d) where d = depth of the deepest optimal solution
B.	A^*	II.	Incomplete even if the search space is finite
C.	Recursive best first search	III.	Optimal if optimal solution is reachable otherwise return the best reachable optimal solution
D.	SMA^*	IV.	Computation and space complexity is two light