Given this undirected graph: What path would a breadth-firs…

Given this undirected graph: What path would a breadth-first search find from vertex A to vertex G.  Just list the vertex names separated by a space with no extra text.  Don’t forget to list the start and end vertices. Hint: You should be able to do this without creating a chart like you did on the homework assignment.