Please complete the code that extracts the MWST, the code must be done using specifically Prim's algorithm. Language: C++ Thank you

Data Structures and Algorithms Graph Theory The Minimum Weighted Spanning Tree (MWST) is defined as a subgraph of G whose total weight (sum of all edges) is smaller than (minimum) any other subgraph of G that connects every vertex (spanning) 4 9410 2 8 2 18 8 Your assignment is to research two algorithms that are commonly used to extract the MWST from a graph G: Prim's algorithm and Kruskal's Algorithm. The assignment briefing