The agent starts from the start node, $$S$,$ and the goal node is marked using $$G$.$

Break ties alphabetically $($e$.$g$.,$ B is visited before D$).$ The edges are undirected, so the

agent can go either way with the same cost.

Using each of the following methods, list the visited nodes $($where order matters$),$ and

answer the returned path.

a$.$ BFS

b$.$ DFS

c$.$ Greedy search

d$.$ Uniform cost search

e$.$ A$*$