problem 3. k-means clustering can be viewed as an optimization problem that attempts to minimize some objective function. for the given objectives, determine the update rule for the centroid, ck of the k-th cluster ck . in other word, find the optimal ck that minimizes the objective function. the data x contains p features.
