Match List I with List II
(A)(B)(C)(D)List IGreedy Best-First SearchA∗Recursive Best-First SearchSMA*(I)(II)(III)(IV)List IISpace complexity is O(d) whered=depth of the deepest optimalsolutionIncomplete even if the search space isfiniteOptimal if optimal solution isreachable; otherwise, returns the bestreachable optimal solutionComputation and space complexityis 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
Attempted by 143 students.