The k-means clustering algorithm is an iterative process. Which of the following best describes the termination condition for the iterations?

The newly calculated center of each cluster does not change. The number of members in one of the clusters is one. When the number of members in none of the clusters is one. When at least one cluster has more than half of the population. The newly calculated center of at least one cluster does not change. In the k-means clustering algorithm, how many centers are used? 1 k 10 k+10 k-1 In the k-means algorithm the centroid of the clusters must coincide with an actual data point. True False