4. (10 Points) The following is an adjacency list representation of an edge weighted graph, where contents inside each pair of parentheses represent an edge and its associated weight. For instance, (0-1 33) represents edge from 0 to 1 with weight 33. For the given edge weighted graph, provide MST weight and MST edges in the order as they are added to the MST, using a) Lazy Prim’s MST algorithm starting from vertex 0 b) Kruskal’s
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured