1. Uniformed and Heuristic Search (25 pts): Consider the search space as illustrated below SStart state 2 G Goal state 3 20 Step cost h-2 e G h-0 5 Heuristic estimate 2 4 a. Derive the search tree b. List the order in which the nodes are expanded for the following search strategies: i Breadth-first search, ii Depth-first search, ii Uniform cost search iv Greedy best-first search V A* search Compute the complexity of each search algorithm in part b. Which one works the best? Is the heuristic function admissible? Explain the reason. c. d