Problem $2.$ Consider the following graph. If there is ever a decision between multiple neighbor nodes in

the Breadth First Search $($BFS$)$ or Depth First Search $($DFS$)$ algorithms, assume we always choose the

letter closest to the beginning of the alphabet first when they have the same distance to the

starting$/$source node.

Hint: Source node is A$.$

In what order will the nodes be visited using a Breadth First Search? $8_{?}$ points$)$Give me the solution for the above question providedGive me a