1. Find the minimum spanning tree (MST) of the following graph by applying the Prim’s algorithm with Node 3 as initial node. Show the order of node joining the MST and the weight of MST. (20%)