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 below. Draw the search tree and the returned path. In all cases, assume ties resolve in such a way that states with earlier alphabetical order are expanded first. Note: "S" is the initial state and "G" is the goal state. a. Depth-first search b. Depth limited search (L=2) c. Breadth-first search d. Uniform-cost search e. Greedy search f. A-star search Solve this problem using the following algorithms. Give a description of the heuristic you will use. Note: ignore moves that returns you to the previous state. a) Depth First Search b) A algorithm