A* Search Algorithm _______________

• A. does not expand the node which have the lowest value of f(n),
• B. finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
• C. terminates when the goal node is not found.
• D. all of the above