Answer Happy

Please I need a detailed explanation to this work for better
understanding. Thank you.
3. Consider the search graph shown below. S is the start state and G is the goal state. All edges are bidirectional. For each of the following search strategies, show how each of the following search strategies would create a search tree to find a path and show the path that would be returned, or write none if no path will be returned. If there are any ties, S h=9 10 1 B h=7 D h=7 h=10 7 E h=1 15 1 2 F h=1 G h=0 3 assume alphabetical tie-breaking. (a) A* search (b) Greedy-best first search