Given the following graph

Show the result of the Breadth$-$first search traversal

for the graph starting from vertex $a.$

Use Prim's algorithm to find a minimum spanning

tree starting from node a$.($you need to justify the

addition of each edge to the minimum spanning

tree$)$

Use Kruskal's algorithm to find a minimum spanning

tree.$($you need to justify the addition of each edge to

the minimum spanning tree$)$