Q6: 2 75 31 3 55 3 79 23 74 86 58 5 23 Consider the above graph where each vertex represents a regional data center. Now suppose that we need to connect these regional data centers with high-speed data links. The weights of the edges represent the estimated cost in millions of dollars for each of these links. Your job is to find the links that enable full connectivity (direct or through another data center) for all vertices at the minimal cost. (Hint: You can find the MST to ensure that all nodes are connected.) (CLO3.1, C4, 1+6+1 Mark] a) Which algorithm can be used to find the MST and solve this problem? Circle the correct answer. 1. Prim's algorithm 2. Huffman coding 3. Master Theorem b) Apply that algorithm and find the edges which ensure full connectivity at the minimum cost. Mark those edges on the graph above. Start at vertex 1. c) What is the minimum cost of this project (total weight of the MST)