Can you help me find the worst case complexity please?

Find the worst-case complexity of the hierarchical clustering algorithm below. You may assume that the distance function takes Theta (1) time to compute. Input: data: set of data points Input: n: size of data Input: distance: distance function that takes two data points and returns a nonnegative real number Input: c: desired number of clusters; must be an integer between 1 and n Output: single-linkage hierarchical clusters for data 1 Algorithm: SingleHClust heap = MinHeap() for i = 1 to n - 1 do for j = i + 1 to n do Insert distance(data[i], data[j]) into heap, along with its corresponding i and j end end s uf = UnionFind(n) count = n while count > c do n (i, jf, dist) = heap.DeleteMin() if ti.Find(i) uf.F'md(j) then if.Union(i, j) count = count - 1 is end end return uf