Question 3: CLO 2 (8 pts) (Search) Consider the search graph where all edges are bidirectional. Suppose we want to go from start state S to goal state G is the goal state. There are four possible solution paths. h=11 1. S-B-E-F-G 2. S-B-E-G 3. S-C-G 4. S-D-G 3 (B h=7 OTO [h=10 h=5 115 Assuming ties (e.g., which child to first explore in depth-first search) should be resolved alphabetically (.e. prefer A before 2), write the number of the solution returned to the right of each of the algorithms below. 14 h=1 (E h=1 h=0 a) (2 points) Depth-First Search returns solution number b) (2 points) Breadth-First search returns solution number c) (2 points) Greedy Search returns solution number d) (2 points) A* Search returns solution number