Use Breadth$-$First$-$Search $($BFS$)$ algorithm to produce a spanning tree for the graph.

Use vertex a as the root of the spanning tree.

Show all the steps $($put numbers along the edges showing which edge was added first, which one was added next, and so forth$).$

$8.$ Use Prim's or Kruskal's algorithms to find the minimum spanning tree for the graph below.

State which algorithm you are using.

Show all the steps $($put numbers along the edges showing which edge was added first, which one was added next, and so forth$).$