6. (10 Points) Given the edge weighted graph as the follows, a) Use Lazy Prim's algorithm to find the Minimum Spanning tree (MST) starting from vertex 0, provide the list of edges in the order as they are added to the (MST) and the weight of MST. b) Use Kruskal's algorithm to find the MST, provide the list of edges in the order as they are added to the (MST) and the weight of MST. 82 46 60 19 68 9 70 20 -28 91 2 30 79 38 85 10 34 74 16 35 3 17 95 5