2? (14%) Assume the graph in the following figure. use both Kruskals and Prims algorthm to compute the Minimum Spanning Tree of the graph. For each algorithm wite down tree edges (denoted by its weight) in the same order as the algorithm adds them to the MST For Prim's algorthm, choose as the starting vertex Kruskal's Algorithm E(T)( s Algorithm E(T)( Prim