Please show step-by-step explanations. Thank you. About the Petersen Graph, (a) The Petersen Graph P is shown below. Assign an edge weight of 1 to each edge of P. Use either Kruskal or Prim’s...

Please show step-by-step explanations. Thank you.

About the Petersen Graph,
(a) The Petersen Graph P is shown below. Assign an edge weight of 1 to each edge of P. Use either Kruskal or Prim’s Algorithm to find a (necessarily minimum weight)
spanning-tree of P.

you must be clear about which
the algorithm you choose and show and explain each step leading to the spanning tree.