Design a polynomial time algorithm to check whether there exist a solution to the good clustering problem for a given set of n points and cluster number k.

Good clustering problem:

input: A set of n points in m-dimensional space, integer k

output: a partition of the n points into k clusters satisfying the Good Clustering Principle(Every pair of points from the same cluster should be closer to each other than any pair of points from different cluster.)