Match List I with List IIList IList II(A) Greedy Best-First Search(I) Space complexity is 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, returns the best reachable optimal solution.(D) SMA*(IV) Computation and space complexity is too high. Choose the correct answer from the options given below:

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