Please provide the DETAILED steps in any format(image, text)
Tree and graph: Given the following weighted undirected graph, show the order the edges would be added for building a spanning tree using Kruskal’s and Prim’s algorithm. Take the following figure as an example, order edges added using two algorithms. In addition, how many edges will be picked up to build the tree? Why? Show your process.
For both the algorithm’s 6 edges will be picked up to build a minimum spanning tree and the total minimum weight will be 38.