dont copy other solutions

2. A star graph is an undirected graph of the following form, i.e. let n be the number of vertices, a star graph consists of a center cycle with n/2 vertices where each pair of connected vertices are also connected to a third vertex: a) (10p) How long would it take Prim's or Kruskal's algorithms to find the minimum spanning tree of a given star graph (as a function of n )? b) (25p) Describe and analyze a more efficient algorithm for finding the minimum spanning tree of a star graph. To get full credit, you need to argue the running time