e Inthe find clustering algorithm, suppose wehave access to the sorted set of edges and weknow that each of the returned clustered willhave at most c nodes for some constant c. Inthis case, what...

Answer the question in the attached pic. It's for Kruskal's Algorithm


e Inthe find clustering algorithm, suppose we have access to the sorted set of edges and we know that each of the returned clustered will have at most c nodes for some constant c. In this case, what would be the execution time of the find clustering algorithm? To receive a full grade, you will need to analyze the running time and express it in big-O terms. Note that in this question, we are assuming that we have access to the sorted set of edges and the running time of sorting the edges should not be counted as a part of the algorithm (30 points).