i think the answer is $55$ as we need to start with the least edge for prims algorythm we need to start with the least edge which is $6$ to $5$ having weight $1$Run Prim's and Kruskal's algorithm on the following graph, and for each algorithm, draw the min$-$cost spanning tree

that it finds, and list the edges in the order in which they are chosen $($you may use the edge costs for this purpose$).$