Given the undirected graph, find the minimum spanning trees using thespecified algorithm. Break ties alphabetically. In each case, label the edges a$,b,c,d,e,$ and $f$ in the order of the addition of the edges to the MST$.$ Also, determine the total weight of the MST$.$

a$.$ Using Kruskal's algorithm;

b$.$ Using Prim's algorithm starting with vertex $A$; and

c$.$ Using Prim's algorithm starting with vertex $S.$