i need answer in 40 minutes ! i will give like !

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: Assume you are given a weighted star graph (each edge has a positive integer weight). Design an efficient algorithm (better than Kruskal and Prim) for finding the minimum spanning tree of the given graph. To get full credit, you need to argue the running time.