Explain in general, what is the best, and worst-case behavior of each of the algorithms. (Greedy Search Strategy, A* Search Strategy, Hill Climbing Strategy)

And What characteristics of the search space and of the heuristic function could make it better to use uniform cost BFS than to use A* search? (Hint: consider the total cost of searching to find a solution.)