Question 1: Consider the state space graph below. For each of the following search strategies, work out the path returned by the search on the graph shown above. Draw the search tree and return the...

Extracted text: Question 1: Consider the state space graph below. For each of the following search strategies, work out the path returned by the search on the graph shown above. Draw the search tree and return the path. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. Note: you may represent the Goal as "G". Node h(n) Start 10 A 6. B 10 D 4 Goal 0 Goal 2 Start a. Depth-first search b. Breadth-first search c. Uniform-cost search d. Greedy search e. A-star search 2.