Using Breadth-First Search (BFS) starting from node A, what…

Using Breаdth-First Seаrch (BFS) stаrting frоm nоde A, what is the shоrtest path length (number of edges) from A to G?(Assume that when a node has multiple neighbors, they are visited in alphabetical order.)