You are given a set U of n objects labeled p1, p2, . . . , pn. A distance function d(pi, pj) provides a numeric value measuring the "closeness" of two objects pi, pj, where 1 i, j n. You are asked to make use of this distance function to divide the n objects into k clusters, where k is a given parameter. You can think of a cluster as a subset of U, where objects in a cluster are "closer" to one another than to objects in another cluster. Propose an algorithm that divides the n objects of U into k clusters, making use of the MST of a graph. Provide a simple argument of correctness and a bound on the running time of the algorithm you are proposing.