## Description

a. Trace through Breadth-First Search of this graph starting atthe leftmost vertex (the one with edges costing 4,6,16 coming fromit). Show the distances of each vertex from the start vertex (Notethat you won’t need the weights for this one)

b. Trace through either Prim’s and Kruskal’s MST algorithms on thisgraph (your choice), showing the graph after each iteration. Ifyou’re using Prim, start at the leftmost ... View full description