Calculate the Minimum Spanning Tree (MST) process separately, starting from node A, using the Prim and Kruskal algorithms in the graph below. Note: Write the edges in the order they were added to the MST. Use node names to represent edges. Example: (A-B), (B-E) 7 6 (A) 2 12 D C 1 B 11 15/13 10 (E) 3 G 14 8 F (H) 9