a. Best-first search is a special case of Uniform Cost Search.
b. A heuristic that always evaluates to h(s)=1 for non-goal search node s is always admissible (given that cost value for each node is positive integer)
c. Hill-climbing can be called Greedy Global Search.
d. Local Search uses less memory than Global Search.
Thank you for helping me <3