Depth First and Breadth first search

Any help with these two questions would be greatly appreciated

Consider depth first search on the following graph, starting 1 point at state S, where G is the only goal state. Assume that ties are broken alphabetically (so a partial plan S>X>A would be expanded before S->X->B and S->A>Z would be expanded before S->B->A). Please enter the final path returned in the box below. Your answer should be a string of letters with S as the first character and G as the last. Don't include arrows or spaces in your answer. For example, if you think the path is S->A->G, enter SAG in the box. (Hint You may want to draw out the search tree on a separate page) * Your answer Now consider a breadth first search traversal on the same graph. What is the final path found?* 1point