Question 2 10 pts We need to choose an algorithm for finding minimal spanning trees in a class of networks { G, wt} such that the underlying graphs G are planar and only have faces bounded by five edges. The number of vertices of G can become arbitrarily large, and the weights of edges can also be arbitrary positive numbers. Will Prim's or Kruskal's algorithm be more computationally efficient for this class of graphs? Justify your answer. Upload Choose a file