Use Prim's algorithm starting at node A to compute the Minimum Spanning Tree (MST) of the given graph. Write down the edges of the MST in the order in which Prim's algorithm adds them to the MST. 12 20 H 14. 10 I F B 25 11