Starting from node "A", apply breadth-first search traversing all remaining nodes. If multiple alternative nodes are available at any step, your choice should be based on alphabetical order. In your solution, provide: a) The output list showing the order in which every node is visited. b) A tree search that indicates the resulting hierarchy from breadth-first search

 

1 [131] C [41] L[76] 30 _Q [107] 45 H [196] D10141 N [160] 90 G[78] 34 mawar mama tam T [127] 110 30 [41] S [164] 4 es prese P[40] 3 M[109] 29-R [122] K [75] F[108]-38-E [139] were 2 we 39. 0 [160] B [152] A[167]