Prove that the worst case time for the QuickFind Union-Find algorithm for O(n) union and find operations is Theta(n^2) for a graph with n vertices. Note the QuickFind algorithm is similar to the algorithm we studied in class in connection with Kruskal's algorithm, but it is unweighted, so that is it does not know the number of vertices in a connected component. So, when a Union operation is performed, merging two connected components, the colors of the first set are changed to that of the second set