QUESTION 1.Consider the search problem below with start state S and goal state G. The transitioncosts are next to the edges, and the heuristic values are next to the states.A, h=4C, h=4E, h=13322S, h=611G, h=03132B, h=4D, h=3.5 F, h=1i. If we use Depth First Search, and it terminates as soon as it reaches the goal state, whatis the final path for this DFS search? If a node has multiple successors, then we alwaysexpand the successors in increasing alphabetical order.ii. What is the final path for

Applications, Advantages and Disadvantages of Depth First Search (DFS) - GeeksforGeeks