Given the following graph G (V, E) which is a portion of a big graph consisting of 1000 vertices following the same structure. 1. You are working towards finding the minimum cost spanning tree for the graph. Which algorithm among the Prim and Kruskal in your opinion will be better for this graph and why? (You are not required to solve the problem using the algorithm. Just give a descriptive answer to this question.) 3 6 3 9 3 7 6 2 4 6 2. You are working towards finding the minimum cost spanning tree for the graph. In your opinion the graph will always have a unique minimum spanning tree or not? Just give a descriptive answer to this